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 Map<Edge,DepthFirstSearch.EdgeType> |
DepthFirstSearch.SpanningTreeResult.edges |
protected List<Edge> |
DefaultPath.edges |
protected Map<Vertex,Set<Edge>> |
AbstractGraphPathSearch.DefaultResult.parents |
Modifier and Type | Method and Description |
---|---|
List<Set<Edge>> |
TarjanGraphSearch.ConnectivityClusterResult.clusterEdges()
Returns the list of edges linking strongly connected vertex clusters.
|
List<Edge> |
Path.edges()
Gets the list of all edges that form the path.
|
Map<Edge,DepthFirstSearch.EdgeType> |
DepthFirstSearch.SpanningTreeResult.edges()
Returns the map of edge classifications.
|
List<Edge> |
DefaultPath.edges() |
Set<Edge> |
Graph.getEdges()
Gets the set of all graph edges.
|
Set<Edge> |
AdjacencyListsGraph.getEdges() |
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) |
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(Edge edge)
Adds the specified edge to the graph.
|
boolean |
AdjacencyListsGraph.add(Edge edge) |
void |
MutablePath.appendEdge(Edge edge)
Appends the given edge to the end of the path.
|
void |
DefaultPath.appendEdge(Edge edge) |
void |
MutablePath.insertEdge(Edge edge)
Inserts the given edge to the start of the path.
|
void |
DefaultPath.insertEdge(Edge edge) |
protected boolean |
DepthFirstSearch.isForwardEdge(AbstractGraphPathSearch.DefaultResult gsr,
Edge e)
Determines whether the specified edge is a forward edge using the
currently accrued set of vertex parent edges.
|
boolean |
MutableGraph.remove(Edge edge)
Deletes the specified edge from the graph.
|
boolean |
AdjacencyListsGraph.remove(Edge edge) |
void |
MutablePath.removeEdge(Edge edge)
Removes the given edge from the path.
|
void |
DefaultPath.removeEdge(Edge edge) |
double |
EdgeWeight.weight(Edge edge)
Return the weight of the specified edge.
|
Modifier and Type | Method and Description |
---|---|
void |
DefaultPath.insertEdges(List<Edge> list) |
Modifier and Type | Class and Description |
---|---|
class |
TopoEdge
Topology edge representing an infrastructure link.
|
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 © 2015. All Rights Reserved.