Analyze the complexity your algorithms
Determine how many components the graph has and print each component in adjacency list representation.
Using Priority-First Search to find a minimum spanning tree for each component and print the adjacency matrix representation of the minimum spanning forest (the union of the minimum spanning trees of the components).
1, 3, 3.22
2, 4, 1.33