Strongly Connected Components: Revision history

28 April 2023

• curprev 09:0609:06, 28 April 2023‎ Admin talk contribs‎ 701 bytes −187‎ No edit summary

10 April 2023

• curprev 08:1908:19, 10 April 2023‎ Admin talk contribs‎ 888 bytes +4‎ No edit summary

15 February 2023

• curprev 14:4114:41, 15 February 2023‎ Admin talk contribs‎ 884 bytes −13‎ No edit summary
• curprev 14:3514:35, 15 February 2023‎ Admin talk contribs‎ 897 bytes −2‎ No edit summary
• curprev 13:0413:04, 15 February 2023‎ Admin talk contribs‎ 899 bytes +14‎ No edit summary
• curprev 12:0212:02, 15 February 2023‎ Admin talk contribs‎ 885 bytes −10‎ No edit summary
• curprev 10:1910:19, 15 February 2023‎ Admin talk contribs‎ 895 bytes −1,693‎ No edit summary

10 October 2022

• curprev 11:0111:01, 10 October 2022‎ Admin talk contribs‎ 2,588 bytes +2,588‎ Created page with "== Problem Description== Connectivity in an undirected graph means that every vertex can reach every other vertex via any path. If the graph is not connected the graph can be broken down into Connected Components. Strong Connectivity applies only to directed graphs. A directed graph is strongly connected if there is a directed path from any vertex to every other vertex. This is same as connectivity in an undirected graph, the only difference being strong connectivity ap..."