Spec
WordGraphA special automaton that stores words instead of single characters along its edges.
A special automaton that stores words instead of single characters along its edges.
Extends | Automaton |
---|---|
All Extended | Automaton, Graph |
All Impl'd | AssignableConcept, ContainerConcept, DestructibleConcept |
Defined in | <seqan/graph_type.h> |
Signature |
template <[typename TAlphabet[, typename Spec]]>
class Graph<Automaton<TAlphabet, String<TAlphabet>, WordGraph<TSpec> >;
|
Interface Function Overview
-
bool canParseString(a[, v], str);
Test whether an WordGraph can parse a string completely. -
TVertexDescriptor getSuccessor(a, v, str);
Gets the successor for a given vertex and an edge label. -
TVertexDescriptor parseString(a, v, beginIt, endIt);, TVertexDescriptor parseString(a, v, str);
Parses a string one character at a time and moves accordingly in the WordGraph.
Interface Functions Inherited From Automaton
assignRoot
canParseString
createOracle
createOracleOnReverse
createRoot
createSuffixTrie
createTrie
createTrieOnReverse
getRoot
getSuccessor
isRoot
parseString
root
Interface Functions Inherited From Graph
addEdge
addEdges
addVertex
assignEdgeMap
assignVertexMap
clear
clearEdges
clearVertices
degree
empty
findEdge
getAdjacencyMatrix
getNil
getVertexAdjacencyVector
inDegree
numEdges
numVertices
outDegree
removeEdge
removeInEdges
removeOutEdges
removeVertex
resizeEdgeMap
resizeVertexMap
sourceVertex
targetVertex
transpose
writeRecords
Interface Functions Inherited From AssignableConcept
Interface Functions Inherited From ContainerConcept
Interface Metafunction Overview
Interface Metafunctions Inherited From Graph
Interface Metafunctions Inherited From ContainerConcept
Interface Functions Detail
bool canParseString(a[, v], str);
Test whether an WordGraph can parse a string completely.
Parameters
a
|
The WordGraph to use for parsing. |
---|---|
v
|
Optionally, the descriptor of the vertex to start at. Defaults to the root. |
str
|
The string to parse. |
Returns
bool |
true if the WordGraph parses str , starting at v, completely and false otherwise. |
---|
Remarks
This has not implemented yet.
Data Races
If not stated otherwise, concurrent invocation is not guaranteed to be thread-safe.
TVertexDescriptor getSuccessor(a, v, str);
Gets the successor for a given vertex and an edge label.
Parameters
a
|
The WordGraph to query for its successor. |
---|---|
v
|
The descriptor fo the vertex to get the successor for. |
str
|
The label. |
Returns
TVertexDescriptor |
A vertex descriptor or nil if successor is not defined. |
---|
Data Races
If not stated otherwise, concurrent invocation is not guaranteed to be thread-safe.
See Also
TVertexDescriptor parseString(a, v, beginIt, endIt);
TVertexDescriptor parseString(a, v, str);
Parses a string one character at a time and moves accordingly in the WordGraph.
Parameters
a
|
An WordGraph. |
---|---|
v
|
The descriptor of the vertex to start at. |
str
|
The ContainerConcept to parse. |
beginIt
|
Begin iterator to sequence to parse. Set to the first character that could not be parsed or to the value of endIt if all of the string was parsed. |
endIt
|
End iterator to sequence to parse. |
Returns
TVertexDescriptor |
The vertex descriptor of the state that was reached after parsing. |
---|
The parsing stops before getSuccessor reaches the nil state or if the complete sequence is read.
Data Races
If not stated otherwise, concurrent invocation is not guaranteed to be thread-safe.