Skip to content
This repository has been archived by the owner on Oct 4, 2024. It is now read-only.

Depth First Search C++ #216

Open
Mohitbagul opened this issue Oct 2, 2024 · 0 comments
Open

Depth First Search C++ #216

Mohitbagul opened this issue Oct 2, 2024 · 0 comments

Comments

@Mohitbagul
Copy link

Mohitbagul commented Oct 2, 2024

C++

You are given a connected undirected graph.
Perform a Depth First Traversal of the graph.
Note: Use the recursive approach to find the DFS traversal of the graph starting from the 0th vertex from left to right according to the graph.

Screenshot 2024-10-02 140708
Screenshot 2024-10-02 140759

Assign me this issue with label for hacktoberfest

@Mohitbagul Mohitbagul changed the title Depth First Search Depth First Search C++ Oct 2, 2024
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Projects
None yet
Development

No branches or pull requests

2 participants