Minimum Spanning Tree

Abstract Data Type Algorithm Data Structure Used Time Complexity
Weighted undirected graph Prim’s Algorithm
C++ Python
Adjacency list
Priority queue
O ( (E+V) log (V) )
Weighted undirected graph Kruskal’s Algorithm Edge list
Disjoint-set
O ( E log V )

Copyright (c) 2019-2020, Algotree.org.
All rights reserved.