Package | Description |
---|---|
com.hp.ds.graph |
Various graph abstractions and algorithms for graph traversal & search, e.g.
|
Modifier and Type | Class and Description |
---|---|
class |
DepthFirstSearch.SpanningTreeResult
Graph search result which includes edge classification for building
a spanning tree.
|
Modifier and Type | Method and Description |
---|---|
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.
|
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.
|
Copyright © 2015. All Rights Reserved.