From 3d5576f485f69b8a2f919a4d5421e16d90197fcd Mon Sep 17 00:00:00 2001 From: Jérémy Zurcher Date: Mon, 14 Nov 2016 06:47:04 +0100 Subject: Algorithms : add 03-algorithms_on_graphs 05-minimum_spanning_tree --- .../02-clustering/clustering.cpp | 28 ++++++++++++++++++++++ .../02-clustering/tests/01 | 14 +++++++++++ .../02-clustering/tests/01.a | 1 + .../02-clustering/tests/02 | 10 ++++++++ .../02-clustering/tests/02.a | 1 + 5 files changed, 54 insertions(+) create mode 100644 03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/clustering.cpp create mode 100644 03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/01 create mode 100644 03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/01.a create mode 100644 03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/02 create mode 100644 03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/02.a (limited to '03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering') diff --git a/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/clustering.cpp b/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/clustering.cpp new file mode 100644 index 0000000..31f00e1 --- /dev/null +++ b/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/clustering.cpp @@ -0,0 +1,28 @@ +#include +#include +#include +#include +#include +#include + +using std::vector; +using std::pair; + + + +double clustering(vector x, vector y, int k) { + //write your code here + return -1.; +} + +int main() { + size_t n; + int k; + std::cin >> n; + vector x(n), y(n); + for (size_t i = 0; i < n; i++) { + std::cin >> x[i] >> y[i]; + } + std::cin >> k; + std::cout << std::setprecision(10) << clustering(x, y, k) << std::endl; +} diff --git a/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/01 b/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/01 new file mode 100644 index 0000000..0acb182 --- /dev/null +++ b/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/01 @@ -0,0 +1,14 @@ +12 +7 6 +4 3 +5 1 +1 7 +2 7 +5 7 +3 3 +7 8 +2 8 +4 4 +6 7 +2 6 +3 diff --git a/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/01.a b/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/01.a new file mode 100644 index 0000000..fafa50f --- /dev/null +++ b/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/01.a @@ -0,0 +1 @@ +2.828427125 diff --git a/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/02 b/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/02 new file mode 100644 index 0000000..62bb252 --- /dev/null +++ b/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/02 @@ -0,0 +1,10 @@ +8 +3 1 +1 2 +4 6 +9 8 +9 9 +8 9 +3 11 +4 12 +4 diff --git a/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/02.a b/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/02.a new file mode 100644 index 0000000..7ed6ff8 --- /dev/null +++ b/03-algorithms_on_graphs/05-minimum_spanning_tree/02-clustering/tests/02.a @@ -0,0 +1 @@ +5 -- cgit v1.2.3