Package [graph, traversal, propagator]

By: ThorstenSeitz

Classes
`EdgePropagator`	Source Code`shared EdgePropagator<V,E,G>given V satisfies Object given E satisfies Edge<V,E> given G satisfies IncidenceGraph<V,E>`
`EdgePropagatorFactory`	Source Code`shared EdgePropagatorFactory<V,E,G>given V satisfies Object given E satisfies Edge<V,E> given G satisfies IncidenceGraph<V,E>`
`GraphPropagator`	Source Code`shared abstract GraphPropagator<Vertex,Adjacency>given Vertex satisfies Object` A `GraphPropagator` defines how a graph traversal propagates to adjacent vertices of a given vertex. It abstracts from whether the adjacent vertices are reached as neighbors of an `AdjacencyGraph` or as targets of adjacent edges of an `IncidenceGraph`.
`PropagatorFactory`	Source Code`shared abstract PropagatorFactory<Vertex,Adjacency,P>given Vertex satisfies Object given P satisfies GraphPropagator<Vertex,Adjacency>`
`VertexPropagator`	Source Code`shared VertexPropagator<V,G>given V satisfies Object given G satisfies AdjacencyGraph<V>`
`VertexPropagatorFactory`	Source Code`shared VertexPropagatorFactory<V,G>given V satisfies Object given G satisfies AdjacencyGraph<V>`