Iterative Depth First Search (DFS) traversal of an Undirected Graph | Implementation

แชร์
ฝัง
  • เผยแพร่เมื่อ 25 ม.ค. 2025

ความคิดเห็น • 7

  • @itsdineshvaryani
    @itsdineshvaryani  4 ปีที่แล้ว +1

    Please *Like* , *Comment* , *Share* , *Subscribe* and *Click Bell* 🔔🔔🔔 Icon for More Updates. To get *Data Structures and Algorithms* complete course for free please follow this link - th-cam.com/play/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d.html

  • @shubhamagarwal1941
    @shubhamagarwal1941 2 ปีที่แล้ว +2

    Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over TH-cam with java implementation and found this. Hats Off To You Man...Excellent Work. GOD BLESS YOU :)

  • @shivamdhaka8755
    @shivamdhaka8755 3 ปีที่แล้ว

    Please resolve my query
    sir
    ... what if i just replace queue to stack in bfs, will it work like dfs because both are looking very similar....

    • @peterho3119
      @peterho3119 ปีที่แล้ว

      it will definitely work

  • @sathiyadev4322
    @sathiyadev4322 2 ปีที่แล้ว +1

    what about directed graph? Sir thats also important ! 🙄