codesankalp / dsalgo

MIT License
8 stars 24 forks source link

added graph traversals #68

Closed rootaux closed 2 years ago

rootaux commented 3 years ago

Description

I have implemented BFS and DFS graph traversals method in Python 3. Both methods return a list which gives the path followed by the algorithm.

Related Issue

Please don't create a Pull request without creating an issue first

Fixes #24

Type of Change:

Code/Quality Assurance Only

Motivation and Context

How Has This Been Tested?

I have tested the programs with some manual inputs. I have yet to write the test file.

Checklist:

Screenshots (if appropriate):

devkapilbansal commented 3 years ago

@codesankalp please review it once

devkapilbansal commented 3 years ago

@rootaux it would be better if you add required test cases too

rootaux commented 3 years ago

@devkapilbansal updated as you requested and I have also added a test. The test is written for the following undirected and directed graphs. undirected graph directed graph

Aryamanz29 commented 2 years ago

Closing this PR, Since contributor is inactive Thanks