Package [graph, traversal, visitor]

modulegraph0.0.1

Search

Filter

By: ThorstenSeitz

Values
`traversalVisitors`	Source Code`shared traversalVisitors traversalVisitors` This object contains some useful visitors. Note that wrapping them into a parent object is only necessary to avoid a compiler backend type inference error. By: ThorstenSeitz

Functions
`mapDistances`	Source Code `shared DistanceMap<Vertex,Weight> mapDistances<Vertex, E, Graph, Weight>(Graph graph, Vertex origin, Weights<Weight,Vertex,E> weights)given Vertex satisfies Object given E satisfies Edge<Vertex,E> given Graph satisfies IncidenceGraph<Vertex,E> given Weight satisfies Summable<Weight> & Comparable<Weight>` Map distances of all vertices of the given graph measured from given origin according to `weights`. Implementation note: uses a breadth first search edge traversal. By: ThorstenSeitz
`mapHops`	Source Code `shared HopDistanceMap<Vertex> mapHops<Vertex, Graph>(Graph graph, Vertex origin)given Vertex satisfies Object given Graph satisfies AdjacencyGraph<Vertex>` Map hop distance of all vertices of the given graph measured from given origin. Implementation note: uses a breadth first search traversal. By: ThorstenSeitz

Interfaces
`DistanceMap`	Source Code`shared DistanceMap<Vertex,Distance>given Vertex satisfies Object` Distance map giving the distance of vertices measured from a given origin according to some measure.
`EdgeVisitor`	Source Code`shared EdgeVisitor<V,E>given V satisfies Object given E satisfies Edge<V,E>` An `EdgeVisitor` is a `TraversalVisitor` with additional callbacks when encountering out-edges.
`HopDistanceMap`	Source Code`shared HopDistanceMap<Vertex>given Vertex satisfies Object` A distance map for hops.
`TraversalVisitor`	Source Code`shared TraversalVisitor<V>` A `TraversalVisitor` is called during a `GraphTraversal` when encountering vertices.
`VertexVisitor`	Source Code`shared VertexVisitor<V>given V satisfies Object` A `VertexVisitor` is a `TraversalVisitor` with additional callbacks when encountering neighbors.

Classes
`DistanceMapper`	Source Code`shared abstract DistanceMapper<Vertex,Distance,DistanceMonoid>given Vertex satisfies Object given Distance satisfies Summable<Distance> & Comparable<Distance> given DistanceMonoid satisfies Monoid<Distance,DistanceMonoid>` A `DistanceMapper` memorizes the distance of each visited vertex from the vertex which has been visited first (called the origin). The distance of a vertex is the least number of edges connecting the origin with that vertex as encountered during the traversal.
`EdgeDistanceMapper`	Source Code`shared EdgeDistanceMapper<Vertex,E,Distance>given Vertex satisfies Object given E satisfies Edge<Vertex,E> given Distance satisfies Summable<Distance> & Comparable<Distance>` An edge-visiting distance mapper.
`HopDistanceMapper`	Source Code`shared HopDistanceMapper<Vertex>given Vertex satisfies Object` A vertex-visiting distance mapper which measures distance in hops, i.e. number of edges.
`Hops`	Source Code`shared Hops` A monoid for counting hops.
`VertexDistanceMapper`	Source Code`shared VertexDistanceMapper<Vertex,Weight>given Vertex satisfies Object given Weight satisfies Summable<Weight> & Comparable<Weight>` A vertex-visiting distance mapper.
`traversalVisitors`	Source Code`shared traversalVisitors` This object contains some useful visitors. Note that wrapping them into a parent object is only necessary to avoid a compiler backend type inference error.