Metadata-Version: 2.1
Name: qplanarity
Version: 1.4.1
Summary: Puzzle game about untangling graphs
Home-page: https://gitlab.com/franksh/qplanarity
Author: Frank S. Hestvik
Author-email: tristesse@gmail.com
License: BSD3
Keywords: planarity,game,qt5,untangle,planar,graph,untangling
Platform: UNKNOWN
Classifier: Development Status :: 5 - Production/Stable
Classifier: License :: OSI Approved :: GNU General Public License v3 (GPLv3)
Classifier: Intended Audience :: End Users/Desktop
Classifier: Programming Language :: Python :: 3
Requires-Python: >=3.7
Description-Content-Type: text/markdown
Requires-Dist: PyQt5
Requires-Dist: numpy
Requires-Dist: scipy


# QPlanarity

QPlanarity is a little puzzle game about untangling graphs.

If you love the meditative feeling of jigsaw puzzles, then you might
like this game. It's a relaxation game, a stress relief kind of thing.
Feels great to make everything neat and planar.

# Installing

Use `pip` or `pip3`:

    $ pip install qplanarity

This should install a script/app/whatever called qplanarity.

# Tips

- Right click nodes (the circles) to "nudge" its connected neighbors
  toward it. Useful for large graphs where nodes overlap a lot.
- The state of the graph is saved on exit, so you shouldn't lose any
  progress.
- Try to weave the tangled mess into a pattern of little triangles if
  you lose track of what's going on.
- A solution is /always/ possible.

# Screenshots

Start of the game:
![scr1](./scr1.png)

In the process of untangling a graph:
![scr2](./scr2.png)

An untangled graph:
![scr3](./scr3.png)

Start of a huge graph:
![scr4](./scr4.png)


