Class Specialization
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.
An automaton, where 0 is the start state.
Graph<Automaton<TAlphabet, TCargo, TSpec> >
Include Headers
The alphabet type that is used for the transition labels.
Metafunctions: Alphabet
Default: char
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: void
Remarks: Use Cargo to get the cargo type of an undirected graph.
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
Word GraphA special automaton that stores words instead of single characters along its edges.
AlphabetAccess to the Alphabet type. (Graph)
CargoType of additional data stored in an object. (Graph)
EdgeDescriptorType of an object that represents an edge descriptor. (Graph)
EdgeIdHandlerType of an object that represents an Id Manager. (Graph)
EdgeTypeEdge type of a graph object. (Graph)
HostType of the object a given object depends on. (Graph)
IteratorType of iterator objects that are used to traverse the container. (Graph)
SpecThe spec of a class. (Graph)
VertexDescriptorType of an object that represents a vertex descriptor. (Graph)
addEdgeAdds a new edge to the graph, either with or without cargo. (Graph)
addEdgesShortcut to add multiple edges at once. Creates vertices implicitly. (Graph)
addVertexAdds a new vertex to the graph. (Graph)
assignEdgeMapInitializes a vertex map with values of an array. (Graph)
assignRootAssigns a new root vertex to the graph.
assignVertexMapInitializes a vertex map with values of an array. (Graph)
canParseStringTest whether an automaton can parse a string completely.
clearResets an object. (Graph)
clearEdgesRemoves all edges in a graph. (Graph)
clearVerticesRemoves all vertices in a graph. (Graph)
createIntervalTreeCreate an interval tree. (Graph)
createRootCreates the root in a tree or an automaton.
degreeNumber of incident edges for a given vertex. (Graph)
emptyTest a container for being empty. (Graph)
findEdgeFinds an edge. (Graph)
getAdjacencyMatrixReturns an adjacency matrix representation of the graph. (Graph)
getRootGet method for the root of a tree or an automaton.
getSuccessorGets the successor for a given vertex and an edge label. For an automaton a single character is required whereas for a word graph getSuccessor takes a string.
inDegreeNumber of incoming edges for a given vertex. (Graph)
isRootTests whether a given vertex is the root or not.
numEdgesNumber of edges in a graph. (Graph)
numVerticesNumber of vertices in a graph. (Graph)
outDegreeNumber of outgoing edges for a given vertex. (Graph)
parseStringParses a string one character at a time and moves accordingly in the automaton.
removeEdgeRemoves an edge from the graph. For automatons a label is required. (Graph)
removeInEdgesRemoves the incoming edges of a given vertex. (Graph)
removeOutEdgesRemoves the outgoing edges of a given vertex. (Graph)
removeVertexRemoves a vertex. (Graph)
resizeEdgeMapInitializes an edge map (Graph)
resizeVertexMapInitializes a vertex map. (Graph)
rootGets a reference to the root of the tree.
sourceVertexReturns the source vertex of an edge. (Graph)
targetVertexReturns the target vertex of an edge. (Graph)
transposeTransposes a graph, either in-place or from source to dest. (Graph)
writeSaves records to a file. (Graph)
SeqAn - Sequence Analysis Library -

Page built @2013/07/11 09:12:38