Skip to content

Implementation of the algorithm to find strongly connected components of a directed graph

Notifications You must be signed in to change notification settings

achyutb6/strongly-connected-components

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

strongly-connected-components

Implement the algorithm to find strongly connected components of a directed graph. Add the method to your DFS class from SP8. Make changes so that all methods share as much of the code as possible.

public static DFS stronglyConnectedComponents(Graph g) { ... }

About

Implementation of the algorithm to find strongly connected components of a directed graph

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages