stefanutti / maps-coloring-python Goto Github PK

Get rid of Sage
Get rid of Sage
Get rid of Sage
Get rid of Sage
Get rid of Sage
...
Get rid of Sage

Sage:

• Return the faces of an embedded graph.
• A combinatorial embedding of a graph is a clockwise ordering of the neighbors of each vertex. From this information one can define the faces of the embedding, which is what this method returns
  • [[(0, 1), (1, 2), (2, 0)], [(3, 2), (2, 1), (1, 3)], [(2, 3), (3, 0), (0, 2)], [(0, 3), (3, 1), (1, 0)]]

New implementation without sage:

• TBD

4ct-create-map.sage.py

• Generate a planar map using sage with the planar() algorithm

4ct.py

• Color the map starting from the planar representation of it, without depending on sage (which is very large)
  • This way external programs can produce maps for the 4ct.py that implements the coloring algorithm