Uses of Interface
com.hp.ds.graph.Graph

Packages that use Graph

Package	Description
com.hp.ds.graph	Various graph abstractions and algorithms for graph traversal & search, e.g.
com.hp.sdn.topo	API for retrieving information about network topology & connectivity.

Uses of Graph in com.hp.ds.graph

Subinterfaces of Graph in com.hp.ds.graph

Modifier and Type	Interface and Description
interface	MutableGraph Abstraction of a mutable directed graph.

Classes in com.hp.ds.graph that implement Graph

Modifier and Type	Class and Description
class	AdjacencyListsGraph Base implementation of a graph, using adjacency lists.

Methods in com.hp.ds.graph with parameters of type Graph

Modifier and Type	Method and Description
TarjanGraphSearch.ConnectivityClusterResult	TarjanGraphSearch.search(Graph g, EdgeWeight ew) Search the graph and produce a result of the search.
GraphSearch.Result	GraphSearch.search(Graph g, EdgeWeight ew) Search the graph and produce a result of the search.
GraphPathSearch.Result	GraphPathSearch.search(Graph g, Vertex src, Vertex dst, EdgeWeight ew) Search the graph producing a set of paths.
GraphPathSearch.Result	DijkstraGraphSearch.search(Graph g, Vertex src, Vertex dst, EdgeWeight ew)
GraphPathSearch.Result	DepthFirstSearch.search(Graph g, Vertex src, Vertex dst, EdgeWeight ew)
GraphPathSearch.Result	DepthFirstRecursiveSearch.search(Graph g, Vertex src, Vertex dst, EdgeWeight ew)
GraphPathSearch.Result	BreadthFirstSearch.search(Graph g, Vertex src, Vertex dst, EdgeWeight ew)
GraphPathSearch.Result	BellmanFordGraphSearch.search(Graph g, Vertex src, Vertex dst, EdgeWeight ew)
protected void	AbstractGraphPathSearch.validate(Graph g, Vertex src, Vertex dst) Validates that the given graph and source are not null and that the source and destination vertices (if given) are part of the graph.

Uses of Graph in com.hp.sdn.topo

Methods in com.hp.sdn.topo that return Graph

Modifier and Type	Method and Description
Graph	TopologyData.graph() Returns the graph model of the network.