public class GraphPruner<N,E>
extends Object

Prunes a graph, creating a new graph with nodes removed. If a node is removed from the graph, any paths through that node will be replaced with edges. In other words, if A and B are nodes in the original graph and the pruned graph, then there exists a path from A -> B in the original graph iff there's a path from A -> B in the pruned graph. We do not make any guarantees about what edges are in the pruned graph.