Homework #27
Homework #27
Conversation
![github-actions[bot]](https://avatars.githubusercontent.com/in/15368?s=60&v=4){kind=small}
|
|
||
| #include <stdexcept> | ||
|
|
||
| #include "graph/vertex.hpp" |
There was a problem hiding this comment.
warning: 'graph/vertex.hpp' file not found [clang-diagnostic-error]
#include "graph/vertex.hpp"
^| @@ -0,0 +1,232 @@ | |||
| #include <gtest/gtest.h> | |||
|
|
|||
| #include "graph/weighted_graph.hpp" | |||
There was a problem hiding this comment.
warning: 'graph/weighted_graph.hpp' file not found [clang-diagnostic-error]
#include "graph/weighted_graph.hpp"
^
|
|
||
| #include <stdexcept> | ||
|
|
||
| #include "graph/vertex.hpp" |
There was a problem hiding this comment.
warning: 'graph/vertex.hpp' file not found [clang-diagnostic-error]
#include "graph/vertex.hpp"
^| @@ -0,0 +1,232 @@ | |||
| #include <gtest/gtest.h> | |||
|
|
|||
| #include "graph/weighted_graph.hpp" | |||
There was a problem hiding this comment.
warning: 'graph/weighted_graph.hpp' file not found [clang-diagnostic-error]
#include "graph/weighted_graph.hpp"
^
| visited[v] = true; | ||
| if (p) d[v] = h[v] = h[p] + 1; | ||
|
|
||
| int children_count = 0; |
There was a problem hiding this comment.
warning: variable 'children_count' of type 'int' can be declared 'const' [misc-const-correctness]
| int children_count = 0; | |
| int const children_count = 0; |
| : graph(is_oriented) { | ||
| if (edges.size() != weights.size()) | ||
| throw std::invalid_argument( | ||
| "The number of weighted edges is greater than the number of all " |
There was a problem hiding this comment.
ну не совсем greater скорее not equal) не сниму за это)
| void DFS(Graph<T>& graph, std::unordered_map<T, bool>& visited, | ||
| std::vector<T>& res, const T& curr_vertex) { | ||
| if (visited[curr_vertex]) | ||
| throw std::invalid_argument("Graph is not acyclic!"); |
There was a problem hiding this comment.
лучше кажется написать что то типа Graph has a cycle, не буду это учитывать
Задания от Акрамова Никиты, группа Б03-314