topology
Package containing topological algorithms for traversal, connectivity, combinatorics, etc.
Connectivity
Construct an adjacency dictionary from a set of edges. 
Combinatorics
Color the vertices of a graph such that no two colors are adjacent. 

Identify the connected components of a graph. 
Orientation
Construct an adjacency dictionary of the given faces, assuming that the faces have arbitrary orientation. 

Construct an adjacency dictionary of the given faces, assuming that the faces have arbitrary orientation. 

Construct an adjacency dictionary of the given faces, assuming that the faces have arbitrary orientation. 

Unify the cycle directions of the given faces such that adjacent faces share opposite halfedges. 

Unify the cycle directions of the given faces such that adjacent faces share opposite halfedges. 

Unify the cycle directions of the given faces such that adjacent faces share opposite halfedges. 
Traversal
Find the path of least weight between two vertices of a graph using the A* search algorithm. 

Find the shortest path between two vertices of a graph or mesh using the A* search algorithm. 

Compute a breadthfirst ordering of the nodes of a graph, starting from a root node. 

Traverse an adjacency dict in "breadthfirst" order. 

Return all paths from root to goal. 

Compute a depthfirst ordering of the nodes of a graph, starting from a root node. 

Compute Dijkstra distances from all nodes in a graph to one target node. 

Find the shortest path between two nodes of a graph if the weights of the connecting edges are not all the same. 

Find the shortest path between two vertices of a network. 