Skip to content

Repository files navigation

DepthFirstSearch

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

About

Implements a simple DFS algorithm in python

Resources

Stars

1 star

Watchers

0 watching

Forks

Releases

Packages

Contributors