{
  "Kruskal's Algorithm": "Greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.",
  "Applications": [
  ],
  "Complexity": {
    "time": "worst O(E log(E))"
  },
  "References": [
    "<a href='https://en.wikipedia.org/wiki/Kruskal%27s_algorithm'>Wikipedia</a>"
  ],
  "files": {
    "normal": "Finds minimum spanning tree of a given graph."
  }
}