Readme #37
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,70 @@ | ||
| #ifndef GRAPH_H_ | ||
| #define GRAPH_H_ | ||
|
|
||
| #include <iostream> | ||
| #include <vector> | ||
|
|
||
| class Graph { | ||
| struct vert_neigh { | ||
| int name; | ||
| double lenght; | ||
|
|
||
| vert_neigh(int name, double lenght) : name{name}, lenght{lenght} {} | ||
| vert_neigh(std::pair<int, double> p) : name{p.first}, lenght{p.second} {} | ||
| }; | ||
|
|
||
| public: | ||
| // { {0, 1}, {1, 0}, {2, 3}, {2, 4}, {2, 5} } | ||
| Graph(int verts_num, std::initializer_list<std::pair<int, int>> links) { | ||
| adjacents = std::vector<std::vector<vert_neigh>>(verts_num, | ||
| std::vector<vert_neigh>()); | ||
| for (auto pair : links) { | ||
| adjacents[pair.first].push_back(vert_neigh(pair.second, 1.)); | ||
| } | ||
| } | ||
|
|
||
| // { {{0, 1}, lenght1}, {{1, 0}, lenght2}, ... } | ||
| Graph(int verts_num, | ||
| std::initializer_list<std::pair<std::pair<int, int>, double>> links) { | ||
| adjacents = std::vector<std::vector<vert_neigh>>(verts_num, | ||
| std::vector<vert_neigh>()); | ||
| for (auto pair : links) { | ||
| adjacents[pair.first.first].push_back( | ||
| vert_neigh(pair.first.second, pair.second)); | ||
| } | ||
| } | ||
|
|
||
| int size() const { return adjacents.size(); } | ||
|
|
||
| void add_vert() { adjacents.push_back({}); } | ||
|
|
||
| friend std::ostream& operator<<(std::ostream& os, const Graph& g) { | ||
| os << " { "; | ||
| for (int i = 0; i < g.adjacents.size(); ++i) { | ||
| for (auto p : g.adjacents[i]) { | ||
| os << "{ {" << i << ", " << p.name << "}, " << p.lenght; | ||
| os << "}, "; | ||
| } | ||
| } | ||
| os << "}"; | ||
| return os; | ||
| } | ||
|
|
||
| void see_vertical() { | ||
| int vert_name = -1; | ||
| for (auto vert : adjacents) { | ||
| vert_name++; | ||
| if (vert.size() == 0) { | ||
| std::cout << vert_name << std::endl; | ||
| continue; | ||
| } | ||
| for (auto link_to : vert) { | ||
| std::cout << vert_name << " -> " << link_to.name | ||
| << ", lenght:" << link_to.lenght << std::endl; | ||
| } | ||
| } | ||
| } | ||
| std::vector<std::vector<vert_neigh>> adjacents; | ||
| }; | ||
|
|
||
| #endif | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,5 +1,242 @@ | ||
| #include <gtest/gtest.h> | ||
|
|
||
| #include <stdexcept> | ||
|
|
||
| #include "topology_sort.hpp" | ||
|
|
||
| bool is_sorted(Graph& g, std::vector<int>& order) { | ||
| for (int i = 0; i < order.size(); ++i) { | ||
| for (int j = i + 1; j < order.size(); ++j) { | ||
| for (auto child : g.adjacents[order[j]]) { | ||
| if (child.name == order[i]) { | ||
| return false; | ||
| } | ||
| } | ||
| } | ||
| } | ||
| return true; | ||
| } | ||
|
|
||
| TEST(non_recursive_topological_sort, Test_1) { | ||
| Graph g(8, { | ||
| {{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| }); | ||
|
|
||
| ASSERT_EQ(is_sorted(g, *topological_sort_dfs_non_rec(g)), true); | ||
| } | ||
|
|
||
| TEST(non_recursive_topological_sort, Test_2) { | ||
| Graph g(8, {{{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| {{2, 3}, 1}}); | ||
|
|
||
| ASSERT_EQ(is_sorted(g, *topological_sort_dfs_non_rec(g)), true); | ||
| } | ||
|
|
||
| TEST(non_recursive_topological_sort, Test_3) { | ||
| Graph g(8, {{{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| {{2, 3}, 1}, | ||
| {{1, 2}, 1}}); | ||
|
|
||
| ASSERT_EQ(is_sorted(g, *topological_sort_dfs_non_rec(g)), true); | ||
| } | ||
|
|
||
| TEST(non_recursive_topological_sort, Test_4) { | ||
| Graph g(9, {{{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| {{8, 0}, 1}, | ||
| {{0, 5}, 1}, | ||
| {{5, 6}, 1}}); | ||
|
|
||
| ASSERT_EQ(is_sorted(g, *topological_sort_dfs_non_rec(g)), true); | ||
| } | ||
|
|
||
| TEST(non_recursive_topological_sort, Test_cycles_1) { | ||
| Graph g(8, {{{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| {{5, 2}, 1}}); | ||
|
|
||
| bool error_occured = false; | ||
|
|
||
| try { | ||
| topological_sort_dfs_non_rec(g); | ||
| } catch (std::runtime_error) { | ||
|
There was a problem hiding this comment. warning: catch handler catches by value; should catch by reference instead [misc-throw-by-value-catch-by-reference] } catch (std::runtime_error) {
^ |
||
| error_occured = true; | ||
| } | ||
|
|
||
| ASSERT_EQ(error_occured, true); | ||
| } | ||
|
|
||
| TEST(non_recursive_topological_sort, Test_cycles_2) { | ||
| Graph g(9, {{{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| {{6, 8}, 1}, | ||
| {{4, 8}, 1}, | ||
| {{8, 3}, 1}}); | ||
|
|
||
| bool error_occured = false; | ||
|
|
||
| try { | ||
| topological_sort_dfs_non_rec(g); | ||
| } catch (std::runtime_error) { | ||
|
There was a problem hiding this comment. warning: catch handler catches by value; should catch by reference instead [misc-throw-by-value-catch-by-reference] } catch (std::runtime_error) {
^ |
||
| error_occured = true; | ||
| } | ||
|
|
||
| ASSERT_EQ(error_occured, true); | ||
| } | ||
|
|
||
| TEST(recursive_topological_sort, Test_1) { | ||
| Graph g(8, { | ||
| {{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| }); | ||
|
|
||
| ASSERT_EQ(is_sorted(g, *topological_sort_dfs_rec(g)), true); | ||
| } | ||
|
|
||
| TEST(recursive_topological_sort, Test_2) { | ||
| Graph g(8, {{{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| {{2, 3}, 1}}); | ||
|
|
||
| ASSERT_EQ(is_sorted(g, *topological_sort_dfs_rec(g)), true); | ||
| } | ||
|
|
||
| TEST(recursive_topological_sort, Test_3) { | ||
| Graph g(8, {{{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| {{2, 3}, 1}, | ||
| {{1, 2}, 1}}); | ||
|
|
||
| ASSERT_EQ(is_sorted(g, *topological_sort_dfs_rec(g)), true); | ||
| } | ||
|
|
||
| TEST(recursive_topological_sort, Test_4) { | ||
| Graph g(9, {{{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| {{8, 0}, 1}, | ||
| {{0, 5}, 1}, | ||
| {{5, 6}, 1}}); | ||
|
|
||
| ASSERT_EQ(is_sorted(g, *topological_sort_dfs_rec(g)), true); | ||
| } | ||
|
|
||
| TEST(recursive_topological_sort, Test_cycles_1) { | ||
| Graph g(8, {{{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| {{5, 2}, 1}}); | ||
|
|
||
| bool error_occured = false; | ||
|
|
||
| try { | ||
| topological_sort_dfs_rec(g); | ||
| } catch (std::runtime_error) { | ||
|
There was a problem hiding this comment. warning: catch handler catches by value; should catch by reference instead [misc-throw-by-value-catch-by-reference] } catch (std::runtime_error) {
^ |
||
| error_occured = true; | ||
| } | ||
|
|
||
| ASSERT_EQ(error_occured, true); | ||
| } | ||
|
|
||
| TEST(recursive_topological_sort, Test_cycles_2) { | ||
| Graph g(9, {{{1, 4}, 4}, | ||
| {{1, 6}, 5}, | ||
| {{2, 7}, 9}, | ||
| {{3, 4}, 1}, | ||
| {{3, 7}, 5.5}, | ||
| {{4, 5}, 3.14}, | ||
| {{7, 0}, 0.2}, | ||
| {{7, 5}, 1.3}, | ||
| {{7, 6}, 2.6}, | ||
| {{6, 8}, 1}, | ||
| {{4, 8}, 1}, | ||
| {{8, 3}, 1}}); | ||
|
|
||
| bool error_occured = false; | ||
|
|
||
| try { | ||
| topological_sort_dfs_rec(g); | ||
| } catch (std::runtime_error) { | ||
|
There was a problem hiding this comment. warning: catch handler catches by value; should catch by reference instead [misc-throw-by-value-catch-by-reference] } catch (std::runtime_error) {
^ |
||
| error_occured = true; | ||
| } | ||
|
|
||
| ASSERT_EQ(error_occured, true); | ||
| } | ||
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
warning: 'iostream' file not found [clang-diagnostic-error]