MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / bridges

Function bridges

graph/code20.cpp:66–80  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

64}
65
66void bridges(vector<int> vec[], int v)
67{
68 vector<int> disc(v), low(v);
69 vector<bool> visited(v, false);
70
71 int time = 1;
72
73 for (int i = 0; i < v; i++)
74 {
75 if (visited[i] == false)
76 {
77 dfs_func(vec, i, visited, disc, low, time, -1);
78 }
79 }
80}
81
82int main()
83{

Callers 1

mainFunction · 0.85

Calls 1

dfs_funcFunction · 0.85

Tested by

no test coverage detected