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.
|
Modifier and Type | Field and Description |
---|---|
protected Vertex |
DefaultPath.dst |
protected Vertex |
DefaultPath.src |
Modifier and Type | Field and Description |
---|---|
protected Map<Vertex,Double> |
AbstractGraphPathSearch.DefaultResult.costs |
protected Map<Vertex,Set<Edge>> |
AbstractGraphPathSearch.DefaultResult.parents |
protected Map<Vertex,Path> |
AbstractGraphPathSearch.DefaultResult.pathMap |
protected Set<Vertex> |
AbstractGraphPathSearch.DefaultResult.sortedDest |
Modifier and Type | Method and Description |
---|---|
Vertex |
Path.dst()
Get the target vertex.
|
Vertex |
Edge.dst()
Returns the destination vertex.
|
Vertex |
DefaultPath.dst() |
Vertex |
Path.src()
Get the source vertex.
|
Vertex |
Edge.src()
Returns the source vertex.
|
Vertex |
DefaultPath.src() |
Modifier and Type | Method and Description |
---|---|
List<Set<Vertex>> |
TarjanGraphSearch.ConnectivityClusterResult.clusterVertices()
Returns the list of strongly connected vertex clusters.
|
Map<Vertex,Double> |
GraphPathSearch.Result.costs()
Return a map of vertex costs in the path.
|
Map<Vertex,Double> |
AbstractGraphPathSearch.DefaultResult.costs() |
Set<Vertex> |
Graph.getVertices()
Gets the set of all graph vertices.
|
Set<Vertex> |
AdjacencyListsGraph.getVertices() |
Map<Vertex,Set<Edge>> |
GraphPathSearch.Result.parents()
Return a map of vertex parent edges in the path.
|
Map<Vertex,Set<Edge>> |
AbstractGraphPathSearch.DefaultResult.parents() |
Modifier and Type | Method and Description |
---|---|
boolean |
MutableGraph.add(Vertex vertex)
Adds the specified vertex to the graph.
|
boolean |
AdjacencyListsGraph.add(Vertex vertex) |
protected void |
AbstractGraphPathSearch.buildPaths(Vertex src,
Vertex dst,
AbstractGraphPathSearch.DefaultResult gsr)
Builds a set of paths for the specified src/dst pair using the provided
maps of parents and costs.
|
Set<Edge> |
Graph.getEdgesFrom(Vertex src)
Gets the set of all edges leading from the given source vertex.
|
Set<Edge> |
AdjacencyListsGraph.getEdgesFrom(Vertex src) |
Set<Edge> |
Graph.getEdgesTo(Vertex dst)
Gets the set of all edges leading from the given source vertex.
|
Set<Edge> |
AdjacencyListsGraph.getEdgesTo(Vertex dst) |
boolean |
MutableGraph.remove(Vertex vertex)
Deletes the specified vertex from the graph.
|
boolean |
AdjacencyListsGraph.remove(Vertex vertex) |
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.
|
Constructor and Description |
---|
DefaultPath(Vertex src,
Vertex dst)
Creates a new path from source to destination.
|
Modifier and Type | Class and Description |
---|---|
class |
TopoVertex
Topology vertex representing a device.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
TopoEdge.dst() |
Vertex |
TopoEdge.src() |
Modifier and Type | Method and Description |
---|---|
Map<Vertex,Set<Edge>> |
TopologyData.broadcastPoints(DeviceId deviceId)
For a given Device Id, get a map of devices and
links on which a packet can be broadcast from the given deviceId.
|
Copyright © 2016. All Rights Reserved.