|
|||||||||||
| PREV LETTER NEXT LETTER | FRAMES NO FRAMES | ||||||||||
ArchetypeGraph which consists of
a Vertex set and an Edge set.
source vertex
to the target vertex.
LinkedHashMap which maps each vertex
in the graph (including the source vertex)
to its distance from the source vertex.
LinkedHashMap which maps each of the closest
numDist vertices to the source vertex
in the graph (including the source vertex)
to its distance from the source vertex.
Map which maps each vertex
in the graph (including the source vertex)
to its distance (represented as a Number)
from source.
Collection of requirements that each edge
must satisfy when it is added to this graph.
Set consisting of all edges e
in graph g that satisfy predicate p,
that is, those for which p.evaluate(e) returns true.
p.
g, if any,
that is equivalent to this edge.
g which are equal
to the edges in g.
g, if any, that is
equal to this vertex.
ag
that is equivalent to this vertex.
g which are equal
to the vertices in g.
source
to target, or null if target is not
reachable from source.
LinkedHashMap which maps each vertex
in the graph (including the source vertex)
to the last edge on the shortest path from the
source vertex.
LinkedHashMap which maps each of the closest
numDist vertices to the source vertex
in the graph (including the source vertex)
to the incoming edge along the path from that vertex.
LinkedHashMap which maps each vertex
in the graph (including the source vertex)
to the last edge on the shortest path from the
source vertex.
SubsetManager, creating it if necessary.
ArchetypeVertex.
v.
EfficientFilter,
then there is a "previous" graph--and thus a previous GraphAssemblyRecord.
v.
List of the edges on the shortest path from
source to target, in order of their
occurrence on this path.
List of the edges on the shortest path from
source to target, in order of their
occurrence on this path.
EdgeRanking, otherwise
if the algorithm is ranking nodes the instances will be of type NodeRanking
Collection of constraints that each vertex
must satisfy when it is added to this graph.
Set consisting of all vertices v
in graph g that satisfy predicate p,
that is, those for which p.evaluate(v) returns true.
p.
|
|||||||||||
| PREV LETTER NEXT LETTER | FRAMES NO FRAMES | ||||||||||