Skip to content

Commit efa50c7

Browse files
committed
move graph.hpp and utils.hpp to .. folder
1 parent 5761e70 commit efa50c7

File tree

7 files changed

+856
-856
lines changed

7 files changed

+856
-856
lines changed

additional_tasks/chem_experiments_chain/src/tarjan_algorithm.hpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
#include <stack>
55
#include <stdexcept>
66

7-
#include "graph/graph.hpp"
7+
#include "graph.hpp"
88

99
namespace {
1010

additional_tasks/graph/src/main.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
#include <iostream>
22

3-
#include "graph/graph.hpp"
3+
#include "graph.hpp"
44

55
template <typename V, typename W>
66
void PrintGraph(const Graph<V, W>& graph) {

additional_tasks/graph/src/test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
#include <gtest/gtest.h>
22

3-
#include "graph/graph.hpp"
3+
#include "graph.hpp"
44

55
TEST(GraphTest_size_t, CreateNonWeightedGraph) {
66
std::vector<std::pair<size_t, size_t>> edges_pairs = {{0, 1}, {1, 2}, {2, 0}};

additional_tasks/petya_and_vasya_labyrinth/src/a_star.hpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
#include <queue>
66
#include <set>
77

8-
#include "graph/graph.hpp"
8+
#include "graph.hpp"
99

1010
/**
1111
* @brief Вычисляет кратчайший путь между двумя вершинами с помощью A*.

additional_tasks/petya_and_vasya_labyrinth/src/topological_sort.hpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
#pragma once
22

3-
#include "graph/graph.hpp"
3+
#include "graph.hpp"
44

55
namespace {
66

0 commit comments

Comments
 (0)