Class Graph<T>

Type parameters

T

Hierarchy

Graph

Implements

IGraph<T>

Index

Constructors

constructor

Properties

Methods

Constructors

constructor

new Graph(): Graph

- Defined in Graph/Graph.ts:26
Returns Graph

Properties

Private _adjacencyList

_adjacencyList: Map<T, PriorityQueue<Connection<T>>>

Private _hasNegativeWeights

_hasNegativeWeights: boolean

Methods

add

add(vertex: T): void

Implementation of IGraph.add
- Defined in Graph/Graph.ts:33
Parameters
- vertex: T
Returns void

bellmanFord

bellmanFord(from: T, to: T): { distance: number; path: T[] }

- Defined in Graph/Graph.ts:181
Requires no negative cycles Complexity O(VE)

Parameters
- from: T
  
  Vertex
- to: T
  
  Vertex
Returns { distance: number; path: T[] }
- distance: number
- path: T[]

connect

connect(connection: Connection<T>): void

Implementation of IGraph.connect
- Defined in Graph/Graph.ts:39
Parameters
- connection: Connection<T>
Returns void

connectionExists

connectionExists(connection: Connection<T>): boolean

Implementation of IGraph.connectionExists
- Defined in Graph/Graph.ts:72
Parameters
- connection: Connection<T>
Returns boolean

dijkstra

dijkstra(from: T, to: T): { distance: number; path: T[] }

- Defined in Graph/Graph.ts:240
Requires no negative weights Complexity O(V + E log V)

Parameters
- from: T
- to: T
Returns { distance: number; path: T[] }
- distance: number
- path: T[]

exists

exists(node: T): boolean

Implementation of IGraph.exists
- Defined in Graph/Graph.ts:68
Parameters
- node: T
Returns boolean

getEdges

getEdges(): Connection<T>[]

Implementation of IGraph.getEdges
- Defined in Graph/Graph.ts:107
Gets all edges in sorted ascending order

Returns Connection<T>[]

getEdgesFor

getEdgesFor(vertex: T): Connection<T>[]

Implementation of IGraph.getEdgesFor
- Defined in Graph/Graph.ts:123
Gets all edges for vertex in sorted ascending order

Parameters
- vertex: T
Returns Connection<T>[]

getVertices

getVertices(): T[]

Implementation of IGraph.getVertices
- Defined in Graph/Graph.ts:94
Returns T[]

minimumSpanningTree

minimumSpanningTree(): Graph<T>

Implementation of IGraph.minimumSpanningTree
- Defined in Graph/Graph.ts:142
Complexity O(V+E) It uses Kruskal's Algorithm

Returns Graph<T>

Private newConnectionPriorityQueue

newConnectionPriorityQueue(): PriorityQueue<Connection<T>>

- Defined in Graph/Graph.ts:302
Returns PriorityQueue<Connection<T>>

shortestPath

shortestPath(from: T, to: T): T[]

Implementation of IGraph.shortestPath
- Defined in Graph/Graph.ts:167
Parameters
- from: T
- to: T
Returns T[]

Generated using TypeDoc