Class Kruskal

Hierarchy

Kruskal

Index

Constructors

Methods

findMST isConnected

Constructors

constructor

new Kruskal(): Kruskal
Returns Kruskal

Methods

`Static` findMST

findMST(vertices, edges): MSTResult
Finds the Minimum Spanning Tree using Kruskal's algorithm
Parameters
- vertices: string[]
  
  array of vertex names
- edges: Edge[]
  
  array of edges with weights
Returns MSTResult
object containing MST edges and total weight
- Defined in algorithms/Kruskal.ts:86

`Static` isConnected

isConnected(vertices, edges): boolean
Checks if a graph is connected (prerequisite for MST)
Parameters
- vertices: string[]
  
  array of vertex names
- edges: Edge[]
  
  array of edges
Returns boolean
true if graph is connected, false otherwise
- Defined in algorithms/Kruskal.ts:119

Generated using TypeDoc