|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
AbstractGraph
description.AbstractGraphMap
description.AbstractGraphVisitor
description.AdjacentEdgeRep
Supports user defined edge types
Maintain a hash table of nodes
to edges.AdjacentEdgeRep
Supports user defined edge types
Maintain a hash table of nodes
to edges.AdjacentNodeRep
description.AllPaths
description.BidirectedEdgeRep
description.BidirectedEdgeVertex
description.BidirectedGraph
description.BidirectedRepAdaptor
description.Bigraph
description.BigraphBuilder
description.BitMatrixRep
description.BreadthFirstSearch
description.ConnectedComponents
description.o
.
DepthFirstSearch
on a graph.DigraphBuilder
description.DirectedEdge
description.DirectedEdgeImpl
description.DirectedEdgeRep
description.DirectedEdgeVertex
description.DirectedGraph
description.DirectedGraphNodeRep
description.DirectedPath
description.Edge
connects two vertices in a graph.EdgeGraph
description.EdgeImpl
description.EdgeRep
description.EdgeVertex
is a vertex that contains it's
own edge information.ExistsPath
description.o
.
getAdjacentVertices
Graph
GraphBuilder
builds a representation of
a graph.GraphEvent
description.GraphEventMulticast
description.GraphException
description.GraphListener
description.GraphMap
description.Graphs
a collections of graph routineGraphTag
description.GraphVisitor
description.GraphVisitor
description.HyperEdge
description.IdentityMap
description.MinimumSpanningTree
is a set of edges that
connects all the vertices in the graph where the total weight of
the edges in the tree is minimized.MultiEdgeGraph
description.MultiMap
description.MultiVisitor
description.MutableGraph
description.Path
abstracts a set of nodes and edges
of a graph representing a connected path.PropertyGraph
interface for graphs that support
interfaces.PropertyMap
manages a Set of property maps.Queue
description.RepSolver
finds the best representations
for some set or constraints.ShortestPath
description.StrongComponents
description.TopologicalSort
of a directed graph.UndirectedEdgeRep
is an interface tag.UndirectedGraph
is an interface tagUndirectedGraphImpl
description.Ungraph
an UndirectedGraphUngraphBuilder
description.o1
and
o2
, say S1 and S2, into a new set that is the
union of these two sets.
UnionFind
Discjoint Set code with some set interfacesDisjointSet
.
Vertex
is an interface tag.VertexGraph
description.
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |