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.

Related Packages

Package	Description
com.google.mu.util	StringFormat, Substring, Optionals and more...
com.google.mu.util.concurrent	Structured Concurrency
com.google.mu.util.concurrent24	Java 24 structured concurrency and gatherers (requires mug-concurrent24 artifact)
com.google.mu.util.stream	BiStream, BiCollector, MoreStreams, MoreCollectors etc.

Class	Description
BinaryTreeWalker<N>	Walker for binary tree topology (see Walker.inBinaryTree()).
CyclicGraphException	Thrown when running into any unexpected cycle during traversal.
GraphWalker<N>	Walker for graph topology (see Walker.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 and breadth-first) as lazily evaluated streams, allowing infinite-size graphs.