UVa 796

In this problem we have to just count the number of bridges.

Explanation
We have to find the critcal links. A link from A to B is said to be critcal if there is no other way to reach B except from A.

Implementations

 * C++ : [Critical Links].

Optimizations

 * We have to apply Bridge finding Algorithm in a very similar way of topological sorting.

Input
6 0 (1) 4 1 (2) 2 3 2 (3) 1 4 5 3 (1) 1 4 (2) 0 2 5 (1) 2

Output
5 critical links 0 - 4 1 - 2 1 - 3 2 - 4 2 - 5

Contributor
Amit Kumar (talk) 12:14, 9 April 2020 (UTC)

see Categories for a list