Uses of Interface
org.onlab.graph.Graph

Packages that use Graph

Package	Description
org.onlab.graph	Graph abstractions and graph path finding algorithms.

Uses of Graph in org.onlab.graph

Subinterfaces of Graph in org.onlab.graph

Modifier and Type	Interface and Description
interface	MutableGraph<V extends Vertex,E extends Edge> Abstraction of a mutable graph that can be constructed gradually.

Classes in org.onlab.graph that implement Graph

Modifier and Type	Class and Description
class	AdjacencyListsGraph<V extends Vertex,E extends Edge<V>> Immutable graph implemented using adjacency lists.
class	MutableAdjacencyListsGraph<V extends Vertex,E extends Edge<V>>

Methods in org.onlab.graph that return Graph

Modifier and Type	Method and Description
Graph<V,E>	MutableGraph.toImmutable() Returns an immutable copy of this graph.
Graph<V,E>	MutableAdjacencyListsGraph.toImmutable()

Methods in org.onlab.graph with parameters of type Graph

Modifier and Type	Method and Description
protected void	AbstractGraphPathSearch.checkArguments(Graph<V,E> graph, V src, V dst) Checks the specified path search arguments for validity.
MutableGraph	SuurballeGraphSearch.mutableCopy(Graph<V,E> graph) Creates a mutable copy of an immutable graph.
TarjanGraphSearch.SccResult<V,E>	TarjanGraphSearch.search(Graph<V,E> graph, EdgeWeight<V,E> weight) Searches the specified graph.
GraphSearch.Result	GraphSearch.search(Graph<V,E> graph, EdgeWeight<V,E> weight) Searches the specified graph.
GraphPathSearch.Result<V,E>	SuurballeGraphSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
GraphPathSearch.Result<V,E>	SrlgGraphSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
GraphPathSearch.Result<V,E>	KShortestPathsSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
GraphPathSearch.Result<V,E>	GraphPathSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths) Searches the specified graph for paths between vertices.
GraphPathSearch.Result<V,E>	DijkstraGraphSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
DepthFirstSearch.SpanningTreeResult	DepthFirstSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
GraphPathSearch.Result<V,E>	BreadthFirstSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
GraphPathSearch.Result<V,E>	BellmanFordGraphSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)