Kruskral Algo

[khal]

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.

class graph
{
  public:
  void loadData(const string nameOfFile); 

  private:
  struct Nodes{
   int vertexs;
   int vertexsWeights;
  };
  vector<vector<Nodes> > digraphs;
  

};