algorithms-ts
Options
All
Public
Public/Protected
All
Inherited
Externals
Only exported
Menu
Abstract
Collection
Abstract
Iterator
Adjacency
List
Digraph
Array
Collection
Array
Iterator
Breadth
First
Directed
Paths
Depth
First
Directed
Paths
Depth
First
OrderDFS
DigraphBFS
DigraphDFS
DirectedDFS
Directed
Eulerian
CycleDFS
Directed
Eulerian
PathDFS
GabowSCC
Heap
Iterator
constructor
copy
for
Each
Remaining
has
Next
next
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
>
HeapIterator
Implements
CollectionIterator
<
E
>
Index
Constructors
constructor
Properties
copy
Methods
for
Each
Remaining
has
Next
next
Constructors
constructor
new
Heap
Iterator
(
pq
:
E
[]
, n
:
number
, copy
:
Queue
<
E
>
)
:
HeapIterator
Parameters
pq:
E
[]
n:
number
copy:
Queue
<
E
>
Returns
HeapIterator
Properties
Private
copy
copy
:
Queue
<
E
>
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