Expand description
Persistent MapGraph & related items
This is the same as a Graph – a collection of nodes and edges connecting them. However, it also maintains an arbitrary mapping of NodeKey to nodes and EdgeKey to edges. So instead of using the NodeIds you’re given, you can use almost any type to identify your nodes – for example, a String. (If you don’t need this, it might be easier to use a regular Graph.)
Structs
Iterator over all edges leaving a node
Iterator over all edges entering a node
Iterator over all edges in a graph
Error: the specified node key is already present in the graph
A directed graph that also maintains an arbitrary key-node and key-edge mapping
Enums
Error when inserting an edge