Class Specialization

Trie

A keyword trie.

A trie for the words announce, annual, and annually. |

Trie |

Parameters

The alphabet type that is used for the transition labels. Metafunctions: Alphabet Default: Remarks: Use Alphabet to get the type of the labels in an automaton. | |

The cargo type that can be attached to the edges. Metafunctions: Cargo Default: Remarks: Use Cargo to get the cargo type of an undirected 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) | |

Resets an object. (Graph) | |

Removes all edges in a graph. (Graph) | |

Removes all vertices in a graph. (Graph) | |

Creates a trie of all suffixes of a text. | |

Creates a trie. | |

Number of incident edges for a given vertex. (Graph) | |

Test a container for being empty. (Graph) | |

Finds an edge. (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) | |

Returns the target vertex of an edge. (Graph) | |

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

Remarks

A keyword trie is a special automaton and thus, it is not implemented in its own class.
It solely provides create functions where based upon a set of strings a keyword trie is created.

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