Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsConnectivity algorithms

Tarjan's algorithm

Theory

Arithmetics

Report a typo

You are given a graph:

What is the biggest sum of nodes' numbers in a SCC?

What is the biggest sum of nodes' numbers in a SCC?
For example, if a graph has SCCs {1, 5, 7}, {4, 6}, {2, 3}, the sums are 13, 10, and 5, respectively, so the answer would be 13.

Enter a number
___

Create a free account to access the full topic