This package contains a Golang library of basic graph algorithms
 and topological ordering.
 .
 This library offers efficient and well-tested algorithms for
  - breadth-first and depth-first search,
  - topological ordering,
  - strongly and weakly connected components,
  - bipartion,
  - shortest paths,
  - maximum flow,
  - Euler walks,
  - and minimum spanning trees.
 The algorithms can be applied to any graph data structure implementing
 the two Iterator methods: Order, which returns the number of vertices,
 and Visit, which iterates over the neighbors of a vertex.