-
Notifications
You must be signed in to change notification settings - Fork 0
Prim'S Algorithm
Pranav Kumar edited this page Aug 26, 2019
·
1 revision
Prim'S Algorithm
Prim-MST(G)
Select an arbitrary vertex s to start the tree from.
While (there are still nontree vertices)
Select the edge of minimum weight between a tree and nontree vertex
Add the selected edge and vertex to the tree Tprim.
Graph Traversal
- BFS
- DFS
Graph Types
- Undirected Graph
- Directed Graph
- Edge Types
-
Weighted Graph
- Equal Weighted Graph
- General Weighted Graph
- Minimum Spanning Tree(MST)
- Variations of MST
- Maximum Spanning Tree
- Minumum Product Spanning Tree
-
Shortest Paths
- Dijkstra'S Algorithm
- BellMan Ford Algorithm
- Floyd-Warshall Algorithm
-
Max Flow
- Ford-Fulkerson Algorithm
- Edmonds-Karp Algorithm
- Dinic's Algorithm
-
Min Cut
- Stoer–Wagner algorithm
- Karger's algorithm