Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Graph-Traversals_Simulation #399

Open
ar-ohi-srivastav opened this issue Mar 17, 2019 · 0 comments
Open

Graph-Traversals_Simulation #399

ar-ohi-srivastav opened this issue Mar 17, 2019 · 0 comments

Comments

@ar-ohi-srivastav
Copy link

Defect Description:
There is some problem with the algorithm for BFS .
Steps to reproduce the issue:
Go to the link
http://cse01-iiith.vlabs.ac.in/exp7/Introduction.html?domain=Computer%20Science&lab=Data%20Structures
Then click on simulation.
Try drawing a graph with self loops .
Expected result:
We should be able to draw a self loop.Secondly if the expected result of the graph traversal is a BFS forest instead of a tree the algorithm does not work. It stops with some of the nodes remaining unvisited.
Actual result:
All this cases are not handled.
Screenshot from 2019-03-17 19-16-33

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant