| Package | Description |
|---|---|
| org.onlab.graph |
Graph abstractions and graph path finding algorithms.
|
| Class and Description |
|---|
| AbstractGraphPathSearch
Basis for various graph path search algorithm implementations.
|
| AbstractGraphPathSearch.DefaultResult
Default path search result that uses the DefaultPath to convey paths
in a graph.
|
| DepthFirstSearch.EdgeType
Graph edge types as classified by the DFS algorithm.
|
| DepthFirstSearch.SpanningTreeResult
Graph search result which includes edge classification for building
a spanning tree.
|
| DijkstraGraphSearch
Dijkstra shortest-path graph search algorithm capable of finding not just
one, but all shortest paths between the source and destinations.
|
| Edge
Representation of a graph edge.
|
| EdgeWeight
Abstraction of a graph edge weight function.
|
| Graph
Abstraction of a directed graph structure.
|
| GraphPathSearch
Representation of a graph path search algorithm.
|
| GraphPathSearch.Result
Abstraction of a path search result.
|
| GraphSearch
Representation of a graph search algorithm and its outcome.
|
| GraphSearch.Result
Notion of a graph search result.
|
| Heap
Implementation of an array-backed heap structure whose sense of order is
imposed by the provided comparator.
|
| MutableGraph
Abstraction of a mutable graph that can be constructed gradually.
|
| MutablePath
Abstraction of a mutable path that allows gradual construction.
|
| Path
Representation of a path in a graph as a sequence of edges.
|
| TarjanGraphSearch.SccResult
Graph search result augmented with SCC vertexData.
|
| Vertex
Representation of a graph vertex.
|
Copyright © 2016. All rights reserved.