directed_graph_danDirectedGraphBreadthFirstIterator.DanDirectedGraphBreadthFirstIterator.md

dangraph / Exports / directed_graph/danDirectedGraphBreadthFirstIterator / DanDirectedGraphBreadthFirstIterator

Class: DanDirectedGraphBreadthFirstIterator<I, D>

directed_graph/danDirectedGraphBreadthFirstIterator.DanDirectedGraphBreadthFirstIterator

The class DanDirectedGraphBreadthFirstIterator implements GraphIterator interface

Type parameters

Name
I
D

Implements

• GraphIterator<DanNode<I, D>>

Table of contents

Constructors

• constructor

Properties

• _currLevelQueue
• _currLevelQueuePosition
• _currentNodeId
• _graph
• _nextLevelQueue
• _nextLevelSet
• _nextNodeId
• _startingNodeId
• _visitedNodes

Methods

• _addNextNodeOutgoingsToNextLevelQueueIfNotAlreadyVisitedOrQueued
• _advance
• _getNodeAndDirectedArcsFromNodeId
• _initFields
• current
• hasNext
• next
• rewind

Constructors

constructor

• new DanDirectedGraphBreadthFirstIterator<I, D>(collection, startingNodeId): DanDirectedGraphBreadthFirstIterator<I, D>

The public class constructor

Type parameters

Name
I
D

Parameters

Name	Type	Description
collection	DanDirectedGraph<I, D>	the directed graph
startingNodeId	I	the starting node identifier

Returns

DanDirectedGraphBreadthFirstIterator<I, D>

Throws

exception if startingNodeId was not found in graph

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:36

Properties

_currLevelQueue

• Private _currLevelQueue: DanNode<I, D>[]

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:22

---

_currLevelQueuePosition

• Private _currLevelQueuePosition: number

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:24

---

_currentNodeId

• Private _currentNodeId: null | I

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:18

---

_graph

• Private _graph: DanDirectedGraph<I, D>

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:12

---

_nextLevelQueue

• Private _nextLevelQueue: DanNode<I, D>[]

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:26

---

_nextLevelSet

• Private _nextLevelSet: Set<I>

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:28

---

_nextNodeId

• Private _nextNodeId: null | I

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:20

---

_startingNodeId

• Private _startingNodeId: I

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:16

---

_visitedNodes

• Private _visitedNodes: Set<I>

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:14

Methods

_addNextNodeOutgoingsToNextLevelQueueIfNotAlreadyVisitedOrQueued

▸ _addNextNodeOutgoingsToNextLevelQueueIfNotAlreadyVisitedOrQueued(): boolean

Add the outgoing nodes of this._nextNodeId to the next-level-queue, if the node was not already visited, and if it's not already present inside the queue

Returns

boolean

true if this._nextNodeId is not null, otherwise false

Throws

exception if this._nextNodeId was not found in graph

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:116

---

_advance

▸ _advance(): void

Advance to the next node in a breadth first fashion

Returns

void

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:137

---

_getNodeAndDirectedArcsFromNodeId

▸ _getNodeAndDirectedArcsFromNodeId(nodeId): DanNodeAndDirectedArcs<I, D>

Retrieve node and directed arcs structure from node identifier

Parameters

Name	Type	Description
nodeId	I	the node identifier

Returns

DanNodeAndDirectedArcs<I, D>

the node and directed arcs structure DanNodeAndDirectedArcs

Throws

exception if nodeId was not found in graph

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:51

---

_initFields

▸ _initFields(startingNodeId): void

Init the class fields with the starting node identifier passed in input

Parameters

Name	Type	Description
startingNodeId	I	the starting node identifier

Returns

void

Throws

exception if startingNodeId was not found in graph

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:64

---

current

▸ current(): undefined | DanNode<I, D>

Get the current node, or return undefined if iterator was not yet started

Returns

undefined | DanNode<I, D>

Throws

exception if this._currentNodeId was not found in graph

Implementation of

GraphIterator.current

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:81

---

hasNext

▸ hasNext(): boolean

Check if the iterator can step to a next node

Returns

boolean

true if the iterator can step to a next node, false if there are no more nodes left to visit in the iterator

Implementation of

GraphIterator.hasNext

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:173

---

next

▸ next(): undefined | DanNode<I, D>

Get the next node, or return undefined if the iterator's end was reached

Returns

undefined | DanNode<I, D>

Throws

exception if this._nextNodeId was not found in graph

Implementation of

GraphIterator.next

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:94

---

rewind

▸ rewind(): void

Restart the iterator

Returns

void

Implementation of

GraphIterator.rewind

Defined in

src/directed_graph/danDirectedGraphBreadthFirstIterator.ts:180