Class Specialization
Undirected Graph
An undirected graph that stores the edges in an adjacency list.
An undirected graph with multiple components.
Undirected Graph
Graph<Undirected<TCargo, TSpec> >
Include Headers
The cargo type that can be attached to the edges.
Metafunctions: Cargo
Default: void
Remarks: Use Cargo to get the cargo type of an undirected graph.
The specializing type for the graph.
Metafunctions: Spec
Default: Default, see Default.
Remarks: Use WithoutEdgeId here to omit edge ids. Note: If edges do not store ids external property maps do not work.
Specialization of
AlphabetAccess to the Alphabet type. (Graph)
CargoType of additional data stored in an object. (Graph)
EdgeDescriptorType of an object that represents an edge descriptor. (Graph)
EdgeIdHandlerType of an object that represents an Id Manager. (Graph)
EdgeTypeEdge type of a graph object. (Graph)
HostType of the object a given object depends on. (Graph)
IteratorType of iterator objects that are used to traverse the container. (Graph)
SpecThe spec of a class. (Graph)
VertexDescriptorType of an object that represents a vertex descriptor. (Graph)
addEdgeAdds a new edge to the graph, either with or without cargo. (Graph)
addEdgesShortcut to add multiple edges at once. Creates vertices implicitly. (Graph)
addVertexAdds a new vertex to the graph. (Graph)
assignEdgeMapInitializes a vertex map with values of an array. (Graph)
assignVertexMapInitializes a vertex map with values of an array. (Graph)
breadthFirstSearchImplements a breadth-first search on a graph.
clearResets an object. (Graph)
clearEdgesRemoves all edges in a graph. (Graph)
clearVerticesRemoves all vertices in a graph. (Graph)
connectedComponentsDecomposes an undirected graph into its connected components.
createIntervalTreeCreate an interval tree. (Graph)
degreeNumber of incident edges for a given vertex. (Graph)
depthFirstSearchImplements a depth-first search on a graph.
emptyTest a container for being empty. (Graph)
findEdgeFinds an edge. (Graph)
getAdjacencyMatrixReturns an adjacency matrix representation of the graph. (Graph)
inDegreeNumber of incoming edges for a given vertex. (Graph)
kruskalsAlgorithmComputes a minimum spanning tree on a graph.
numEdgesNumber of edges in a graph. (Graph)
numVerticesNumber of vertices in a graph. (Graph)
outDegreeNumber of outgoing edges for a given vertex. (Graph)
primsAlgorithmComputes a minimum spanning tree on a graph.
removeEdgeRemoves an edge from the graph. For automatons a label is required. (Graph)
removeInEdgesRemoves the incoming edges of a given vertex. (Graph)
removeOutEdgesRemoves the outgoing edges of a given vertex. (Graph)
removeVertexRemoves a vertex. (Graph)
resizeEdgeMapInitializes an edge map (Graph)
resizeVertexMapInitializes a vertex map. (Graph)
sourceVertexReturns the source vertex of an edge. (Graph)
targetVertexReturns the target vertex of an edge. (Graph)
transposeTransposes a graph, either in-place or from source to dest. (Graph)
upgmaTreeComputes a guide tree from a distance matrix.
writeSaves records to a file. (Graph)
SeqAn - Sequence Analysis Library -

Page built @2013/07/11 09:12:39