Skip to content

Printing edges with their type using non recursive DFS #1177

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.

Sign up for GitHub

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

Jump to bottom
Merged
merged 3 commits into from
Oct 24, 2017
Merged

Printing edges with their type using non recursive DFS #1177

merged 3 commits into from
Oct 24, 2017

Conversation

@abhardwaj1998
Copy link
Contributor

@abhardwaj1998 abhardwaj1998 commented Oct 24, 2017 •
edited
Loading

Pull Request checklist -

  • This pull request fixes #issue_reference (Create an issue if not already present.)
  • The directory structure is of the form (directory_name) (If directory doesn't exist, create a new.)
  • Don't duplicate stuff.

Make sure all the above conditions are met before a PR is created.

@abhardwaj1998
Add files via upload
39982f9 
This program prints all edges of a given graph with their type: Back , Forward , Cross , Tree using non-recursive DFS.
@abhardwaj1998
Delete PrintingEdgesInGraphWithType.cpp
78ea075
@abhardwaj1998
Add files via upload
987fe30 
This program creates a graph and prints DFS traversal order and finally print all edges with their types by traversing through non recursive DFS
@t2013anurag t2013anurag added this to the Hacktoberfest ends milestone Oct 24, 2017
@t2013anurag t2013anurag merged commit e0195ee into hacktoberfest17:master Oct 24, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

@t2013anurag t2013anurag t2013anurag approved these changes

Assignees

No one assigned

Labels

Hacktoberfest

Projects

None yet

Milestone

Hacktoberfest ends

Development

Successfully merging this pull request may close these issues.

2 participants

@abhardwaj1998 @t2013anurag