Expand description
Contains an implementation of the data structure described in A simple linear time algorithm for embedding maximal planar graphs
Structs§
- Index
Iter - A helper struct for iterating over all nodes/edges in the ListGraph
- List
Graph - The structure containing the graphs
Type Aliases§
- EdgeId
- The type of the edge id
- Edge
Index Iter - A helper struct for iterating over all edges in the ListGraph
- NodeId
- The type of the node id
- Node
Index Iter - A helper struct for iterating over all nodes in the ListGraph