max number , DFS BFS - Githubissues

C0D1NG / Programming

39 stars 280 forks source link

Closed shashikant-sk closed 7 months ago

shashikant-sk commented 7 months ago

finding the highest element in list by using if else , and graph problem by using DFS and BFS.

a recursive depth-first search approach to explore the graph and find a path from the start to end node. same with BFS

welcome[bot] commented 7 months ago

Congrats on making your first Pull Request in the C0D1NG Organization! 🥳