diff options
| author | Paul Jungeblut <paul.jungeblut@gmail.com> | 2017-10-28 11:50:29 +0200 |
|---|---|---|
| committer | Paul Jungeblut <paul.jungeblut@gmail.com> | 2017-10-28 11:50:29 +0200 |
| commit | 5e3d0a8cc013c4461a1e096604a9d67b8f3e0d8e (patch) | |
| tree | 26db0c1ee0f2413c94d451f873e317c46a39bb58 /graph/kruskal.cpp | |
| parent | 91a710ac42ec72e14c54bd942ddc53fbb0b8c406 (diff) | |
Removing Kruskal code.
Diffstat (limited to 'graph/kruskal.cpp')
| -rw-r--r-- | graph/kruskal.cpp | 9 |
1 files changed, 0 insertions, 9 deletions
diff --git a/graph/kruskal.cpp b/graph/kruskal.cpp deleted file mode 100644 index 0bd2e22..0000000 --- a/graph/kruskal.cpp +++ /dev/null @@ -1,9 +0,0 @@ -// Union-Find Implementierung von oben. Laufzeit: O(|E|*log(|E|)) -sort(edges.begin(), edges.end()); -vector<ii> mst; int cost = 0; -for (auto &e : edges) { - if (findSet(e.from) != findSet(e.to)) { - unionSets(e.from, e.to); - mst.push_back(ii(e.from, e.to)); - cost += e.cost; -}} |
