This module defines two data types for working with graphs:
SimpleGraphtype represents undirected graphs without loops or multiple edges.
SimpleDigraphtype represents directed graphs in which there may be at most one directed edge
(u,v)from a vertex
uto a vertex
v. There may also be a directed edge in the opposite direction,
SimpleHypergraphtype representing hypergraphs in which edges may be any subset of the vertex set.
Additional functionality can be found in these modules:
SimpleGraph Algorithmsfor functions relying on [integer] linear programming.
SimpleGraphRepresentationsfor creating and analyzing some special classes of graphs.
Please see the Wiki for
extensive information pertaining to the
SimpleDigraph type is not so well developed nor documented. See the
source files in the
src directory. Likewise, the
type is in early stages of development.
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 (firstname.lastname@example.org)
2 days ago