graph-dfs 0.0.8

Graphs and Depth First Search

Graph-DFS

This package allows for the creation of graphs. It also provides the depth first search algorithm.

Installation

pip install graph-dfs

How to use it?

To create a graph, do:

g = Graph(n)

where n is the number of vertices. To create an arc from vertex a to vertex b, do:

g.link(a, b)

where a and b are indices in the range [0, n - 1]. You can perform a depth first search on the graph with:

dfs = DFS(g)
dfs.start()

If you desire to obtain a topological sorting of the graph, then do so after a DFS with:

dfs.topological_sorting()