Class

Graph

Generic graph.

Include Headers

seqan/graph_types.h

Parameters

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

An alignment graph. | |

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. | |

A directed graph that stores the edges in an adjacency list. | |

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. | |

A factor oracle. | |

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. | |

A keyword trie. | |

An undirected graph that stores the edges in an adjacency list. |

Metafunctions

Access to the Alphabet type. | |

Type of additional data stored in an object. | |

Type of an object that represents an edge descriptor. | |

Type of an object that represents an Id Manager. | |

Edge type of a graph object. | |

Type of the object a given object depends on. | |

Type of iterator objects that are used to traverse the container. | |

The spec of a class. | |

Type of an object that represents a vertex descriptor. |

Functions

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. | |

Initializes a vertex map with values of an array. | |

Initializes a vertex map with values of an array. | |

Resets an object. | |

Removes all edges in a graph. | |

Removes all vertices in a graph. | |

Create an interval tree. | |

Number of incident edges for a given vertex. | |

Test a container for being empty. | |

Finds an edge. | |

Returns an adjacency matrix representation of the graph. | |

Number of incoming edges for a given vertex. | |

Number of edges in a graph. | |

Number of vertices in a graph. | |

Number of outgoing edges for a given vertex. | |

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. | |

Initializes an edge map | |

Initializes a vertex map. | |

Returns the source vertex of an edge. | |

Returns the target vertex of an edge. | |

Transposes a graph, either in-place or from source to dest. | |

Saves records to a file. |

Example Programs

Bellman-Ford Algorithm, Longest Increasing Subsequence, Topological Sort, Breadth-First Search, Strongly Connected Components, Transitive Closure, HMM Silent States, Kruskals Algorithm, Heaviest Increasing Subsequence, Floyd-Warshall Algorithm, Maximum Flow, Shortest Path in DAGs, HMM, Prims Algorithm, All Pairs Shortest Path, Depth-First Search, Dijkstras Algorithm, Longest Common Subsequence

SeqAn - Sequence Analysis Library - www.seqan.de