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
search
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
Implementation of Breadth First Search.
Type parameters
V
Hierarchy
DigraphBFS
Implements
DigraphSearch
<
V
>
Index
Methods
search
Methods
search
search
(
dg
:
Digraph
<
V
>
, source
:
Vertex
<
V
>
, visitor
:
VertexVisitor
<
V
>
)
:
void
Parameters
dg:
Digraph
<
V
>
source:
Vertex
<
V
>
visitor:
VertexVisitor
<
V
>
Returns
void
Generated using
TypeDoc
Implementation of Breadth First Search.