Preparing search index...
The search index is not available
refa - v0.12.1
refa
FAIterators
hasCycle
Function hasCycle
has
Cycle
<
S
>
(
iter
:
FAIterator
<
S
,
Iterable
<
S
>
>
)
:
boolean
Returns whether the given graph contains a cycle reachable from the initial state.
Type Parameters
S
Parameters
iter
:
FAIterator
<
S
,
Iterable
<
S
>
>
Returns
boolean
Settings
Member Visibility
Inherited
Theme
OS
Light
Dark
refa -
v0.12.1
DFA
ENFA
FAIterators
MapFABuilder
Mermaid
Edge
Mermaid
Node
Node
Info
Simple
Print
Options
To
Dot
Options
To
Mermaid
Options
MapFABuilder
Node
To
Dot
Attrs
approximate
Rejecting
Word
Set
can
Reach
Final
count
ensure
Stable
Out
filter
Out
Iter
for
Each
from
Word
Sets
from
Words
has
Cycle
intersection
iterate
States
iterate
Word
Sets
language
Is
Finite
make
Deterministic
make
Initial
Final
make
Initial
Non
Final
map
Out
map
Out
Iter
remove
Dead
States
shortest
Accepting
Path
shortest
Word
Set
to
Dot
to
Mermaid
to
Regex
to
String
with
Get
Out
with
Initial
with
Is
Final
JS
NFA
Transformers
Words
Char
Base
Char
Map
Char
Set
Combined
Transformer
DFA
ENFA
Max
Character
Error
NFA
Too
Many
Nodes
Error
Alternation
Assertion
Char
Range
Character
Class
Concatenation
Expression
FABuilder
FAIterator
Finite
Automaton
Node
Factory
Quantifier
Readonly
Char
Map
ReadonlyDFA
ReadonlyENFA
ReadonlyNFA
Source
Location
To
Regex
Options
Transform
Context
Transform
Events
Transform
Options
Transformer
Transition
Iterable
Unknown
Visit
Ast
Handler
Visit
No
Parent
Ast
Handler
Char
Element
No
Parent
Node
Parent
Readonly
Word
Readonly
Word
Set
Transition
Iterator
Word
Word
Set
combine
Transformers
get
Intersection
Iterator
get
Intersection
Word
Sets
get
Intersection
Words
is
Disjoint
With
set
Parent
set
Source
transform
visit
Ast
Returns whether the given graph contains a cycle reachable from the initial state.