Implements a Depth-First-Search based algorithm to find strongly connected components in a Directed Graph.
Uses Adjacency lists to represent the graphs.
Written in Python 3.3
-
Notifications
You must be signed in to change notification settings - Fork 1
frahman5/DepthFirstSearch
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implements a simple DFS algorithm in python
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published