- Version 0.7.0 reworks graph embedding. One new feature is that vertices do not have to all be colored the same (as was the case in previous versions).
- Version 0.6.0 introduces rotation systems which are combinatorial representations of embeddings on oriented surfaces.
- As of version 0.5.2 the function
vertex_typeis deprecated. Useeltypeinstead. - As of version 0.5.0 the polynomials returned by functions such as
char_polyare of typeSimplePolynomial.
This module defines three data types for working with graphs:
- The
SimpleGraphtype represents undirected graphs without loops or multiple edges. - The
SimpleDigraphtype represents directed graphs in which there may be at most one directed edge(u,v)from a vertexuto a vertexv. There may also be a directed edge in the opposite direction,(v,u). - The
SimpleHypergraphtype representing hypergraphs in which edges may be any subset of the vertex set.
Additional functionality can be found in these modules:
DrawSimpleGraphsfor visualization.SimpleGraphAlgorithmsfor functions relying on [integer] linear programming.
In addition, we have:
- A nascent
SimplePlanarGraphsmodule with extremely limited functionality. - An older
SimpleGraphRepresentationsmodule that I am not currently maintaining.
Please see the Wiki for
extensive information pertaining to the SimpleGraph type.
The SimpleDigraph type is not so well developed nor documented. See the
source files in the src directory. Likewise, the SimpleHypergraph
type is in early stages of development.
This software is part of a larger suite of tools for graph theory. More information can be found right after my explanation that this code is postcardware.
Thank you to JHU students Tara Abrishami and Laura Bao for contributions to this project.
This is a work in process with a lot of more features that can/should be added. If you're interested in contributing, please contact me. I'm especially interested in JHU undergraduates getting involved.
Ed Scheinerman (ers@jhu.edu)