Metafunction
VertexDescriptor
Type of an object that represents a vertex descriptor.
Parameters
Type T must be a graph. All graphs currently use ids as vertex descriptors. |
Return Values
VertexDescriptor type. |
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. | |
| Shortcut to add multiple edges at once. Creates vertices implicitly. | |
| Adds a new vertex to the graph. | |
| Assigns a begin state. | |
| Assigns a new emission probability. | |
| Assigns an end state. | |
| Assigns a property to an item in the property map. | |
| Assigns a new root vertex to the automaton. | |
| Assigns a new transition probability. | |
| Computes shortest paths from a single source in a graph. | |
| Implements a breadth-first search on a graph. | |
| Returns the child vertex of an edge. | |
| Returns all leaves underneath a given vertex. | |
| Computes shortest paths from a single source in a directed acyclic graph (DAG). | |
| Number of incident edges for a given vertex. | |
| Computes shortest paths from a single source in a graph. | |
| Returns a reference to the emission probability. | |
| Finds an edge. | |
| Finds a vertex given a sequence id and a position. | |
| Computes a maximum flow in a directed graph. | |
| Gets the begin position for this vertex descriptor in the sequence. | |
| Gets the length of the label of a given vertex descriptor in the sequence. | |
| Returns the emission probability. | |
| Get method for an item's property. | |
| Get method for the root of a tree or an automaton. | |
| Gets the successor for a given vertex and an edge label. For an automaton a single character is required whereas for a word graph getSuccessor takes a string. | |
| Returns the transition probability. | |
| Number of incoming edges for a given vertex. | |
| Tests whether a given vertex is a leaf or not. | |
| Tests whether a given vertex is the root or not. | |
| Computes a minimum spanning tree on a graph. | |
| Gets the label that is associated with this vertex descriptor. | |
| Number of children of a given tree vertex. | |
| Number of outgoing edges for a given vertex. | |
| Returns the parent vertex of an edge. | |
| Parses a string one character at a time and moves accordingly in the automaton. | |
| Computes a minimum spanning tree on a graph. | |
| Accesses the property of an item in the property map. | |
| 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. | |
| Removes the incoming edges of a given vertex. | |
| Removes the outgoing edges of a given vertex. | |
| Removes a vertex. | |
| Gets a reference to the root of the tree. | |
| Gets the sequence id that is associated with this vertex descriptor. | |
| Returns the source vertex of an edge. | |
| Returns the target vertex of an edge. | |
| Returns a reference to the transition probability. |
Remarks
The vertex descriptor is a unique handle to a vertex in a graph.
It is used in various graph functions, e.g., to add edges, to create OutEdge Iterators or to remove a vertex.
It is also used to attach properties to vertices.
Examples
SeqAn - Sequence Analysis Library - www.seqan.de