Package com.google.mu.util.graph
package com.google.mu.util.graph
Stream-based incremental graph algorithms.
Package Specification
The code is developed and tested under Java 8.0.-
ClassDescriptionWalker for binary tree topology (see
Walker.inBinaryTree()
).Thrown when running into any unexpected cycle during traversal.GraphWalker<N>Walker for graph topology (seeWalker.inGraph()
).ShortestPath<N>The Dijkstra shortest path algorithm implemented as a lazy, incrementally-computed stream.Walker<N>Implements generic graph and tree traversal algorithms (pre-order
,post-order
andbreadth-first
) as lazily evaluated streams, allowing infinite-size graphs.