| Metafunction VertexDescriptor Type of an object that represents a vertex descriptor. VertexDescriptor<T>::Type Parameters
T | Type T must be a graph. All graphs currently use ids as vertex descriptors. Types: EdgeStump, Graph
Return Values
Type | VertexDescriptor type.
Functions
addChild | Adds a new child vertex to a parent vertex. Optionally a cargo can be attached to the parent-child edge.
addEdge | Adds a new edge to the graph, either with or without cargo.
addEdges | Shortcut to add multiple edges at once. Creates vertices implicitly.
addVertex | Adds a new vertex to the graph.
assignProperty | Assigns a property to an item in the property map.
assignRoot | Assigns a new root vertex to the automaton.
bellman_ford_algorithm | Computes shortest paths from a single source in a graph.
breadth_first_search | Implements a breadth-first search on a graph.
childVertex | Returns the child vertex of an edge.
collectLeaves | Returns all leaves underneath a given vertex.
dag_shortest_path | Computes shortest paths from a single source in a directed acyclic graph (DAG).
degree | Number of incident edges for a given vertex.
dijkstra | Computes shortest paths from a single source in a graph.
findEdge | Finds an edge.
findVertex | Finds a vertex given a sequence id and a position.
ford_fulkerson | Computes a maximum flow in a directed graph.
fragmentBegin | Gets the begin position for this vertex descriptor in the sequence.
fragmentLength | Gets the length of the label of a given vertex descriptor in the sequence.
getNilPredecessor | Utility function for various graph algorithms.
getProperty | Get method for an item's property.
getRoot | Get method for the root of a tree or an automaton.
getSuccessor | 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.
inDegree | Number of incoming edges for a given vertex.
isLeaf | Tests whether a given vertex is a leaf or not.
isRoot | Tests whether a given vertex is the root or not.
kruskals_algorithm | Computes a minimum spanning tree on a graph.
label | Gets the label that is associated with this vertex descriptor.
numChildren | Number of children of a given tree vertex.
outDegree | Number of outgoing edges for a given vertex.
parentVertex | Returns the parent vertex of an edge.
parseString | Parses a string one character at a time and moves accordingly in the automaton.
prims_algorithm | Computes a minimum spanning tree on a graph.
property | Accesses the property of an item in the property map.
removeAllChildren | Removes all children from the tree given a parent.
removeChild | Removes a child from the tree given a parent.
removeEdge | Removes an edge from the graph. For automatons a label is required.
removeInEdges | Removes the incoming edges of a given vertex.
removeOutEdges | Removes the outgoing edges of a given vertex.
removeVertex | Removes a vertex.
root | Gets a reference to the root of the tree.
sequenceId | Gets the sequence id that is associated with this vertex descriptor.
sourceVertex | Returns the source vertex of an edge.
targetVertex | Returns the target vertex of an edge.
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 VertexDescriptor<Graph<> >::Type vD; //vD is a vertex descriptor SeqAn - Sequence Analysis Library - www.seqan.de