| Class Graph Generic graph.
Graph
Alignment Graph | Automaton | Directed graph | Hmm | Oracle | Tree
Word Graph
Trie | Undirected graph
Graph<TSpec> Parameters
TSpec | The specializing type determines the kind of graph, e.g., directed, undirected, tree, or automaton. Default: Directed<> Remarks: The default Graph<> corresponds to a directed graph.
Specializations
Alignment Graph | An alignment graph.
Automaton | An Automaton has directed edges, labeled with input symbols, and a distinct start state, called root. The input symbols require the use of a third parameter: The alphabet of the input symbols.
Directed graph | A directed graph that stores the edges in an adjacency list.
Hmm | An Hmm is a directed graph with edges labeled with transition probabilities and emission profiles for each vertex. Vertices correspond to states in an HMM.
Oracle | A factor oracle.
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.
Trie | A keyword trie.
Undirected graph | An undirected graph that stores the edges in an adjacency list.
Metafunctions
Alphabet | Access to the Alphabet type.
Cargo | Type of additional data stored in an object.
EdgeDescriptor | Type of an object that represents an edge descriptor.
EdgeIdHandler | Type of an object that represents an Id Manager.
EdgeType | Edge type of a graph object.
Host | Type of the object a given object depends on.
Iterator | Type of iterator objects that are used to traverse the container.
Spec | The spec of a class.
VertexDescriptor | Type of an object that represents a vertex descriptor.
Functions
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.
all_pairs_shortest_path | Finds shortest paths between all pairs of vertices in a graph.
bellman_ford_algorithm | Computes shortest paths from a single source in a graph.
breadth_first_search | Implements a breadth-first search on a graph.
clear | Resets an object.
clearEdges | Removes all edges in a graph.
clearVertices | Removes all vertices in a graph.
degree | Number of incident edges for a given vertex.
depth_first_search | Implements a depth-first search on a graph.
dijkstra | Computes shortest paths from a single source in a graph.
empty | Test a container for being empty.
findEdge | Finds an edge.
floyd_warshall | Finds shortest paths between all pairs of vertices in a graph.
getAdjacencyMatrix | Returns an adjacency matrix representation of the graph.
inDegree | Number of incoming edges for a given vertex.
kruskals_algorithm | Computes a minimum spanning tree on a graph.
numEdges | Number of edges in a graph.
numVertices | Number of vertices in a graph.
outDegree | Number of outgoing edges for a given vertex.
prims_algorithm | Computes a minimum spanning tree on a graph.
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.
resizeEdgeMap | Initializes an edge map
resizeVertexMap | Initializes a vertex map.
sourceVertex | Returns the source vertex of an edge.
targetVertex | Returns the target vertex of an edge.
transitive_closure | Determines whether there is a path between any two given vertices or not.
transpose | Transposes a graph, either in-place or from source to dest.
Example Programs All Pairs Shortest Path, Bellman-Ford Algorithm, Breadth-First Search, Depth-First Search, Dijkstras Algorithm, Floyd-Warshall Algorithm, Gotohs Algorithm, Heaviest Increasing Subsequence, Hirschbergs Algorithm, Kruskals Algorithm, Longest Common Subsequence, Longest Increasing Subsequence, Maximum Flow, Needleman-Wunsch Algorithm, Prims Algorithm, Shortest Path in DAGs, Smith-Waterman Algorithm, Strongly Connected Components, T-Coffee, Topological Sort, Transitive Closure SeqAn - Sequence Analysis Library - www.seqan.de