backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-04 02:59:43 +08:00
Code Issues Projects Releases Wiki Activity

fix: clang-format for graph/ (#1056)

Browse Source 
* fix: clang-format for graph/

* remove graph.h
This commit is contained in:
Filip Hlasek
2020-08-27 07:28:31 -07:00
committed by GitHub
parent 3239fcc19e
commit 79fb528dad
11 changed files with 67 additions and 60 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
graph/bridge_finding_with_tarjan_algorithm.cpp
View File

@@ -27,14 +27,14 @@ class Solution {
bridge.push_back({itr, current_node});
}
}
out_time[current_node] = std::min(out_time[current_node], out_time[itr]);
out_time[current_node] =
std::min(out_time[current_node], out_time[itr]);
}
}
public:
std::vector<std::vector<int>> search_bridges(
int n,
const std::vector<std::vector<int>>& connections) {
int n, const std::vector<std::vector<int>>& connections) {
timer = 0;
graph.resize(n);
in_time.assign(n, 0);
@@ -73,7 +73,8 @@ int main() {
* I assumed that the graph is bi-directional and connected.
*
*/
std::vector<std::vector<int>> bridges = s1.search_bridges(number_of_node, node);
std::vector<std::vector<int>> bridges =
s1.search_bridges(number_of_node, node);
std::cout << bridges.size() << " bridges found!\n";
for (auto& itr : bridges) {
std::cout << itr[0] << " --> " << itr[1] << '\n';