algorithms-ts
Options
All
Public
Public/Protected
All
Inherited
Externals
Only exported
Menu
Abstract
Collection
Abstract
Iterator
Adjacency
List
Digraph
Array
Collection
Array
Iterator
constructor
array
cursor
last
Ret
for
Each
Remaining
has
Next
next
Breadth
First
Directed
Paths
Depth
First
Directed
Paths
Depth
First
OrderDFS
DigraphBFS
DigraphDFS
DirectedDFS
Directed
Eulerian
CycleDFS
Directed
Eulerian
PathDFS
GabowSCC
Heap
Iterator
Kosaraju
SharirSCC
Linked
Queue
Linked
Stack
Nodes
Iterator
Priority
Queue
Queue
Directed
Cycle
String
Map
TarjanSCC
Topological
OrderDFS
Transitive
ClosureDFS
Cycle
Entry
Node
is
Inexact
is
Marked
Type parameters
E
Hierarchy
AbstractIterator
<
E
>
ArrayIterator
Implements
CollectionIterator
<
E
>
Index
Constructors
constructor
Properties
array
cursor
last
Ret
Methods
for
Each
Remaining
has
Next
next
Constructors
constructor
new
Array
Iterator
(
array
:
E
[]
)
:
ArrayIterator
Parameters
array:
E
[]
Returns
ArrayIterator
Properties
Private
array
array
:
E
[]
Private
cursor
cursor
:
number
= 0
Private
last
Ret
last
Ret
:
number
= -1
Methods
for
Each
Remaining
for
Each
Remaining
(
f
:
function
)
:
void
Parameters
f:
function
(
e
:
E
)
:
void
Parameters
e:
E
Returns
void
Returns
void
has
Next
has
Next
(
)
:
boolean
Returns
boolean
next
next
(
)
:
E
Returns
E
Generated using
TypeDoc