Class Specialization
Directed Graph
A directed graph that stores the edges in an adjacency list.

A directed graph.

Graph

Directed Graph

Graph<Directed<TCargo, TSpec> >
Include Headers
seqan/graph_types.h
Parameters

TCargo | The cargo type that can be attached to the edges. Metafunctions: Cargo Default: void Remarks: Use Cargo to get the cargo type of a directed graph.
TSpec | The specializing type for the graph. Metafunctions: Spec Default: Default, see Default. Remarks: Use WithoutEdgeId here to omit edge ids. Note: If edges do not store ids external property maps do not work.

Specialization of
Graph
Metafunctions

Alphabet | Access to the Alphabet type. (Graph)
Cargo | Type of additional data stored in an object. (Graph)
EdgeDescriptor | Type of an object that represents an edge descriptor. (Graph)
EdgeIdHandler | Type of an object that represents an Id Manager. (Graph)
EdgeType | Edge type of a graph object. (Graph)
Host | Type of the object a given object depends on. (Graph)
Iterator | Type of iterator objects that are used to traverse the container. (Graph)
Spec | The spec of a class. (Graph)
VertexDescriptor | Type of an object that represents a vertex descriptor. (Graph)

Functions

addEdge | Adds a new edge to the graph, either with or without cargo. (Graph)
addEdges | Shortcut to add multiple edges at once. Creates vertices implicitly. (Graph)
addVertex | Adds a new vertex to the graph. (Graph)
allPairsShortestPath | Finds shortest paths between all pairs of vertices in a graph.
assignEdgeMap | Initializes a vertex map with values of an array. (Graph)
assignVertexMap | Initializes a vertex map with values of an array. (Graph)
bellmanFordAlgorithm | Computes shortest paths from a single source in a directed graph.
breadthFirstSearch | Implements a breadth-first search on a graph.
clear | Resets an object. (Graph)
clearEdges | Removes all edges in a graph. (Graph)
clearVertices | Removes all vertices in a graph. (Graph)
createIntervalTree | Create an interval tree. (Graph)
dagShortestPath | Computes shortest paths from a single source in a directed acyclic graph (DAG).
degree | Number of incident edges for a given vertex. (Graph)
depthFirstSearch | 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. (Graph)
findEdge | Finds an edge. (Graph)
floydWarshallAlgorithm | Finds shortest paths between all pairs of vertices in a graph.
fordFulkersonAlgorithm | Computes a maximum flow in a directed graph.
getAdjacencyMatrix | Returns an adjacency matrix representation of the graph. (Graph)
inDegree | Number of incoming edges for a given vertex. (Graph)
numEdges | Number of edges in a graph. (Graph)
numVertices | Number of vertices in a graph. (Graph)
outDegree | Number of outgoing edges for a given vertex. (Graph)
removeEdge | Removes an edge from the graph. For automatons a label is required. (Graph)
removeInEdges | Removes the incoming edges of a given vertex. (Graph)
removeOutEdges | Removes the outgoing edges of a given vertex. (Graph)
removeVertex | Removes a vertex. (Graph)
resizeEdgeMap | Initializes an edge map (Graph)
resizeVertexMap | Initializes a vertex map. (Graph)
sourceVertex | Returns the source vertex of an edge. (Graph)
stronglyConnectedComponents | Decomposes a directed graph into its strongly connected components.
targetVertex | Returns the target vertex of an edge. (Graph)
topologicalSort | Performs a topological sort on a directed acyclic graph (DAG).
transitiveClosure | 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. (Graph)
weaklyConnectedComponents | Compute weakly connected components of a directed graph.
write | Saves records to a file. (Graph)

SeqAn - Sequence Analysis Library - www.seqan.de

Page built @2014/10/13 16:13:00