Class DijkstraCalculator

Hierarchy

DijkstraCalculator

Index

Constructors

constructor

Properties

adjacencyList

Methods

Constructors

constructor

new DijkstraCalculator(): DijkstraCalculator

- Defined in lib/index.ts:84
Returns DijkstraCalculator

Properties

adjacencyList

adjacencyList: {}

Type declaration

[key: NodeId]: { id: NodeId; weight: number }[]

Methods

addEdge

addEdge(vertex1: NodeId, vertex2: NodeId, weight?: number): void

- Defined in lib/index.ts:94
Parameters
- vertex1: NodeId
- vertex2: NodeId
- Default value weight: number = 1
Returns void

addVertex

addVertex(vertex: NodeId): void

- Defined in lib/index.ts:90
Parameters
- vertex: NodeId
Returns void

calculateShortestPath

calculateShortestPath(start: NodeId, finish: NodeId): string[]

- Defined in lib/index.ts:105
Given the provided weights of each edge

Parameters
- start: NodeId
  
  The starting NodeId to begin traversal
- finish: NodeId
  
  The ending NodeId to complete traversal
Returns string[]

an {@type Array} showing how to traverse the nodes. If traversal is impossible then it will return an empty array

calculateShortestPathAsLinkedListResult

calculateShortestPathAsLinkedListResult(start: NodeId, finish: NodeId): LinkedListItem[]

- Defined in lib/index.ts:174
Creates a linked list of the result with each element with a source and target property

Parameters
- start: NodeId
  
  The starting NodeId to begin traversal
- finish: NodeId
  
  The ending NodeId to complete traversal
Returns LinkedListItem[]

Returns an array where each element is a LinkedListItem

Generated using TypeDoc