Hey guys I am trying to implement kruskral algorithm using a adjacency list. I was unable to find any pseudo code for this algorithm using adjacency list. I was hoping someone could explain the step or provide a pseudo code for me to follow.
My adjlist has this form.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
void loadData(const string nameOfFile);
vector<vector<Nodes> > digraphs;