Deleted useless sentence for minimum spanning trees.

1 files changed, 1 insertions, 4 deletions

diff --git a/graph/kruskal.cpp b/graph/kruskal.cpp
index 4703c45..124c8bb 100644
--- a/graph/kruskal.cpp
+++ b/graph/kruskal.cpp
@@ -1,6 +1,3 @@
-typedef pair<int,int> ii;
-typedef vector<pair<int,ii>> graph;
-
 //Takes a Graph g (EdgeList!!!) with N nodes and computes the MST and Cost of it. Runtime: O(|E|*log(|E|))
 //Requires UnionFind-Datastructure!!!
 pair<graph,int> buildMST(int N, graph& g) {
@@ -15,4 +12,4 @@ pair<graph,int> buildMST(int N, graph& g) {
     }
   }
   return make_pair(mst,mst_cost);
-}
\ No newline at end of file
+}