Prims Algorithm Illustrate how Prims algorithm works on an undirected graph G(V,E) with a weight function w:ER starting from vertex A :

- Illustrate how Prim's algorithm works on an undirected graph G(V,E) with a weight function w:ER starting from vertex A : - Note: Edges are stored alphabetically in the adjacency list. Hint: Follow the Figure 23.5