Module: Bridges. articulation points


Problem

1/4

Definition of up vertices

Theory Click to read/hide

Error

Problem


Count the up's for all vertices, assuming DFS starts at vertex 1 and time_in is numbered from 1. 
You need to complete the code so that the program displays the answer to this problem.

time 1000 ms
memory 32 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include <iostream>
#include <vector>
using namespace std;
int main()
{
 
for(int i = 0; i < arr.size(); i++)
cout << arr[i] << " ";
return 0;
}

     

Program check result

To check the solution of the problem, you need to register or log in!