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

Function arti_point

graph/code19.cpp:72–110  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

70}
71
72void arti_point(vector<int> vec[], int v)
73{
74 vector<bool> visited(v, false), isap(v, false);
75 vector<int> disc(v), low(v);
76
77 int time = 1;
78
79 for (int i = 0; i < v; i++)
80 {
81 if (visited[i] == false)
82 {
83 dist_minm(vec, i, visited, disc, low, time, -1, isap);
84 }
85 }
86
87 cout << "All articulation points: " << endl;
88 for (int i = 0; i < isap.size(); i++)
89 {
90 if (isap[i] == true)
91 {
92 cout << i << " ";
93 }
94 }
95 cout << endl;
96
97 // cout << "disc time: " << endl;
98 // for (int i = 0; i < disc.size(); i++)
99 // {
100 // cout << disc[i] << " ";
101 // }
102
103 // cout << endl;
104 // cout << "low time: " << endl;
105 // for (int i = 0; i < low.size(); i++)
106 // {
107 // cout << low[i] << " ";
108 // }
109 // cout << endl;
110}
111
112int main()
113{

Callers 1

mainFunction · 0.85

Calls 2

dist_minmFunction · 0.85
sizeMethod · 0.45

Tested by

no test coverage detected