[−][src]Module gamma::graph
Structs
| ArrayGraph | A Graph backed by an adjacency array. Nodes are generated and iterated in sequence from 0 to order -1. |
| HashGraph | A Graph backed by an adjacency map. Nodes will not necessarily be iterated in numerical order, but all iteration orders are stable. As such, HashGraph works well when extracting subgraphs from other graphs. |
| Step | A single traversal step comprised of source and target nodes, and a boolean flag indicating whether a cycle cut is present. |
Enums
| Error |
Traits
| Graph | An unweighted, undirected graph. |