Uses of Package
com.google.mu.util.graph

Packages that use com.google.mu.util.graph

Package	Description
com.google.mu.util.graph	Stream-based incremental graph algorithms.

Classes in com.google.mu.util.graph used by com.google.mu.util.graph

Class	Description
BinaryTreeWalker	Walker for binary tree topology (see Walker.inBinaryTree()).
GraphWalker	Walker for graph topology (see Walker.inGraph()).
ShortestPath	The Dijkstra shortest path algorithm implemented as a lazy, incrementally-computed stream.
Walker	Implements generic graph and tree traversal algorithms (pre-order, post-order and breadth-first) as lazily evaluated streams, allowing infinite-size graphs.