Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
DFS Usually start working towards LEFT MOST DEPTH, So In this Example,, The Order will be "ABFGHJIDEC". Thank You.Good Teaching!!
great explaination sir !!!
That cool bro!Thanks you very much
5:27 why we do not push B then C?
how do know to use stack data structure for dfs
You are marking node visited when you POP it out. That seems wrong. You should mark it visited as soon as you push it into the stack.
Visited here means processed or being processed.
That depends on whether you're doing it recursively without a stack or iteratively using a stack.
Good Explanation.
Nice !!!!
nice
Wolf Pack
BFS DFS mix kardiya hai
How ? Can you please explain.
@@TuringMachines sir i think 3rd step me B or C ko ek sath push nai kr skty its either B or C then you pop one of them or phir uss ko explore krty hn agr dead end ho to last visited pe jaty hn i am not sure though.
DFS Usually start working towards LEFT MOST DEPTH, So In this Example,, The Order will be "ABFGHJIDEC". Thank You.Good Teaching!!
great explaination sir !!!
That cool bro!
Thanks you very much
5:27 why we do not push B then C?
how do know to use stack data structure for dfs
You are marking node visited when you POP it out. That seems wrong. You should mark it visited as soon as you push it into the stack.
Visited here means processed or being processed.
That depends on whether you're doing it recursively without a stack or iteratively using a stack.
Good Explanation.
Nice !!!!
nice
Wolf Pack
BFS DFS mix kardiya hai
How ? Can you please explain.
@@TuringMachines sir i think 3rd step me B or C ko ek sath push nai kr skty its either B or C then you pop one of them or phir uss ko explore krty hn agr dead end ho to last visited pe jaty hn i am not sure though.
nice
nice