Given a directed graph on n vertices (V = {1,..., n})

[Michael Krowford]

Given a directed graph on n vertices (V = {1,..., n}), which is obtained from a path graph (whose edges lead from I vertex to i + 1) by adding some more m data edges. Find the number of strong connectivity components per O (m log m).

 

[Deleted member 4993]

Given a directed graph on n vertices (V = {1,..., n}), which is obtained from a path graph (whose edges lead from I vertex to i + 1) by adding some more m data edges. Find the number of strong connectivity components per O (m log m).

Please show us what you have tried and exactly where you are stuck.

Please follow the rules of posting in this forum, as enunciated at:

https://www.freemathhelp.com/forum/threads/read-before-posting.109846/#post-486520

Please share your work/thoughts about this assignment.