Write the psuedo code for the Depth first Search.

C++ programming on UNIX, C++ Networking,C++ Algorithm Questions and Answers

(Continued from previous question...)

Write the psuedo code for the Depth first Search.

dfs(G, v) //OUTLINE
Mark v as "discovered"
For each vertex w such that edge vw is in G:
If w is undiscovered:
dfs(G, w); that is, explore vw, visit w, explore from there as much as possible, and backtrack from w to v. Otherwise:
"Check" vw without visiting w. Mark v as "finished".

(Continued on next question...)

Other Interview Questions

• C/C++ Questions only (Null Pointers)
• Describe Stacks and name a couple of places where stacks are useful.
• Suppose a 3-bit sequence number is used in the selective-reject ARQ, what is the maximum number of frames that could be transmitted at a time?
• Write the psuedo code for the Depth first Search.
• C++ gamedev interview questions (2)
• C++ gamedev interview questions (2)
• Could you tell something about the Unix System Kernel?
• C/C++ Questions only (Structures, Unions, and Enumerations)
• C/C++ Questions only (Pointers)
• Give 4 examples which belongs application layer in TCP/IP architecture?
• More...