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 |
 | | ||||||
Tree | |||||||
Include Headers
seqan/graph_types.h
Parameters
The cargo type that can be attached to the edges. Metafunctions: Cargo Default: Remarks: Use Cargo to get the cargo type of the tree. | |
The specializing type for the graph. Metafunctions: Spec |
Specialization of
Metafunctions
| Access to the Alphabet type. (Graph) | |
| Type of additional data stored in an object. (Graph) | |
| Type of an object that represents an edge descriptor. (Graph) | |
| Type of an object that represents an Id Manager. (Graph) | |
| Edge type of a graph object. (Graph) | |
| Type of the object a given object depends on. (Graph) | |
| Type of iterator objects that are used to traverse the container. (Graph) | |
| The spec of a class. (Graph) | |
| Type of an object that represents a vertex descriptor. (Graph) |
Functions
| Adds a new child vertex to a parent vertex. Optionally a cargo can be attached to the parent-child edge. | |
| Adds a new edge to the graph, either with or without cargo. (Graph) | |
| Shortcut to add multiple edges at once. Creates vertices implicitly. (Graph) | |
| Adds a new vertex to the graph. (Graph) | |
| Initializes a vertex map with values of an array. (Graph) | |
| Assigns a new root vertex to the graph. | |
| Initializes a vertex map with values of an array. (Graph) | |
| Returns the child vertex of an edge. | |
| Resets an object. (Graph) | |
| Removes all edges in a graph. (Graph) | |
| Removes all vertices in a graph. (Graph) | |
| Returns all leaves underneath a given vertex. | |
| Create an interval tree. (Graph) | |
| Creates the root in a tree or an automaton. | |
| Number of incident edges for a given vertex. (Graph) | |
| Test a container for being empty. (Graph) | |
| Finds an edge. (Graph) | |
| Returns an adjacency matrix representation of the graph. (Graph) | |
| Get method for the root of a tree or an automaton. | |
| Number of incoming edges for a given vertex. (Graph) | |
| Tests whether a given vertex is a leaf or not. | |
| Tests whether a given vertex is the root or not. | |
| Computes a guide tree from a distance matrix. | |
| Number of children of a given tree vertex. | |
| Number of edges in a graph. (Graph) | |
| Number of tree edges. | |
| Number of vertices in a graph. (Graph) | |
| Number of outgoing edges for a given vertex. (Graph) | |
| Returns the parent vertex of an edge or vertex. | |
| Performs a progressive alignment. | |
| Removes all children from the tree given a parent. | |
| Removes a child from the tree given a parent. | |
| Removes an edge from the graph. For automatons a label is required. (Graph) | |
| Removes the incoming edges of a given vertex. (Graph) | |
| Removes the outgoing edges of a given vertex. (Graph) | |
| Removes a vertex. (Graph) | |
| Initializes an edge map (Graph) | |
| Initializes a vertex map. (Graph) | |
| Gets a reference to the root of the tree. | |
| Returns the source vertex of an edge. (Graph) | |
| Returns the target vertex of an edge. (Graph) | |
| Transposes a graph, either in-place or from source to dest. (Graph) | |
| Computes a guide tree from a distance matrix. | |
| Saves records to a file. (Graph) |
Example Programs
Bellman-Ford Algorithm, Longest Increasing Subsequence, Topological Sort, Breadth-First Search, Strongly Connected Components, Transitive Closure, HMM Silent States, Kruskals Algorithm, Heaviest Increasing Subsequence, Floyd-Warshall Algorithm, Maximum Flow, Shortest Path in DAGs, HMM, Prims Algorithm, All Pairs Shortest Path, Depth-First Search, Dijkstras Algorithm, Longest Common Subsequence
SeqAn - Sequence Analysis Library - www.seqan.de