Expand description

Contains an implementation of the data structure described in A simple linear time algorithm for embedding maximal planar graphs

Structs

A helper struct for iterating over all nodes/edges in the ListGraph
The structure containing the graphs

Type Definitions

The type of the edge id
A helper struct for iterating over all edges in the ListGraph
The type of the node id
A helper struct for iterating over all nodes in the ListGraph