Class Specialization
Tree
A Tree has a distinct root and directed edges. The source vertex of each edge is the parent vertex, the target vertex of each edge is the child. Trees provide fast access to child vertices and the parent.
A tree, where 0 is the root vertex.
Graph
Tree
Graph<Tree<TCargo, TSpec> >
Parameters
TCargo
The cargo type that can be attached to the edges.
Metafunctions: Cargo
Default: void
Remarks: Use Cargo to get the cargo type of the tree.
TSpec
The specializing type for the graph.
Metafunctions: Spec
Default: Default, see Default.
Specialization of
Metafunctions
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)
Functions
addChildAdds a new child vertex to a parent vertex. Optionally a cargo can be attached to the parent-child edge.
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)
all_pairs_shortest_pathFinds shortest paths between all pairs of vertices in a graph. (Graph)
bellman_ford_algorithmComputes shortest paths from a single source in a graph. (Graph)
breadth_first_searchImplements a breadth-first search on a graph. (Graph)
childVertexReturns the child vertex of an edge.
clearResets an object. (Graph)
clearEdgesRemoves all edges in a graph. (Graph)
clearVerticesRemoves all vertices in a graph. (Graph)
collectLeavesReturns all leaves underneath a given vertex.
createRootCreates the root in a tree or an automaton.
degreeNumber of incident edges for a given vertex. (Graph)
depth_first_searchImplements a depth-first search on a graph. (Graph)
dijkstraComputes shortest paths from a single source in a graph. (Graph)
emptyTest a container for being empty. (Graph)
findEdgeFinds an edge. (Graph)
floyd_warshallFinds shortest paths between all pairs of vertices in a graph. (Graph)
getAdjacencyMatrixReturns an adjacency matrix representation of the graph. (Graph)
getRootGet method for the root of a tree or an automaton.
inDegreeNumber of incoming edges for a given vertex. (Graph)
isLeafTests whether a given vertex is a leaf or not.
isRootTests whether a given vertex is the root or not.
kruskals_algorithmComputes a minimum spanning tree on a graph. (Graph)
numChildrenNumber of children of a given tree vertex.
numEdgesNumber of edges in a graph. (Graph)
numTreeEdgesNumber of tree edges.
numVerticesNumber of vertices in a graph. (Graph)
outDegreeNumber of outgoing edges for a given vertex. (Graph)
parentVertexReturns the parent vertex of an edge.
prims_algorithmComputes a minimum spanning tree on a graph. (Graph)
progressiveAlignmentPerforms a progressive alignment.
removeAllChildrenRemoves all children from the tree given a parent.
removeChildRemoves a child from the tree given a parent.
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)
rootGets a reference to the root of the tree.
slowNjTreeComputes a guide tree from a distance matrix.
sourceVertexReturns the source vertex of an edge. (Graph)
targetVertexReturns the target vertex of an edge. (Graph)
transitive_closureDetermines whether there is a path between any two given vertices or not. (Graph)
transposeTransposes a graph, either in-place or from source to dest. (Graph)
upgmaTreeComputes a guide tree from a distance matrix.
SeqAn - Sequence Analysis Library - www.seqan.de