Class Specialization
Directed graph
A directed graph that stores the edges in an adjacency list.
 |
| A directed graph. |
 | | ||||||
Directed graph | |||||||
Parameters
The cargo type that can be attached to the edges. Metafunctions: Cargo Default: Remarks: Use Cargo to get the cargo type of a directed graph. | |
The specializing type for the graph. Metafunctions: Spec Remarks: Use WithoutEdgeId here to omit edge ids.
Note: If edges do not store ids external property maps do not work. |
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 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) | |
| Finds shortest paths between all pairs of vertices in a graph. | |
| Computes shortest paths from a single source in a directed graph. | |
| Implements a breadth-first search on a graph. | |
| Resets an object. (Graph) | |
| Removes all edges in a graph. (Graph) | |
| Removes all vertices in a graph. (Graph) | |
| Computes shortest paths from a single source in a directed acyclic graph (DAG). | |
| Number of incident edges for a given vertex. (Graph) | |
| Implements a depth-first search on a graph. | |
| Computes shortest paths from a single source in a graph. | |
| Test a container for being empty. (Graph) | |
| Finds an edge. (Graph) | |
| Finds shortest paths between all pairs of vertices in a graph. | |
| Computes a maximum flow in a directed graph. | |
| Returns an adjacency matrix representation of the graph. (Graph) | |
| Number of incoming edges for a given vertex. (Graph) | |
| Number of edges in a graph. (Graph) | |
| Number of vertices in a graph. (Graph) | |
| Number of outgoing edges for a given vertex. (Graph) | |
| 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) | |
| Returns the source vertex of an edge. (Graph) | |
| Decomposes a directed graph into its strongly connected components. | |
| Returns the target vertex of an edge. (Graph) | |
| Performs a topological sort on a directed acyclic graph (DAG). | |
| Determines whether there is a path between any two given vertices or not. | |
| Transposes a graph, either in-place or from source to dest. (Graph) |
Example Programs
All Pairs Shortest Path, Bellman-Ford Algorithm, Breadth-First Search, Depth-First Search, Dijkstras Algorithm, Floyd-Warshall Algorithm, Heaviest Increasing Subsequence, HMM, HMM Silent States, Kruskals Algorithm, Longest Common Subsequence, Longest Increasing Subsequence, Maximum Flow, Prims Algorithm, Shortest Path in DAGs, Strongly Connected Components, Topological Sort, Transitive Closure
SeqAn - Sequence Analysis Library - www.seqan.de