Static Private addStatic edgesStatic findMSTFinds the Minimum Spanning Tree using Prim's algorithm
weighted graph as adjacency list
Optional start: stringstarting vertex (optional, uses first vertex if not provided)
object containing MST edges and total weight
Static findMSTFromGenerated using TypeDoc
Helper method to add edges from a vertex to the edge list Note: This implementation sorts the edges array on each iteration. For better performance with large graphs, consider using a proper priority queue data structure (e.g., binary heap).