Description

Hello! Hope you remember me. I have yet another data structure assignment. Hope we can work together again 🙂 Please check out the assignment!

Q1) Explain how the DFS manipulates the Stack and how Euler’s DFS algorithm works. Instructions attached.

Q2) Instructions are attached.

Q3)

1.) Can you use a Queue versus a Stack with MST?

2.) If you could use a Queue versus a Stack what would the major difference in program efficiency?

HereÂ’s a Hint

Well, it seems to work for Vertex Zero using a Queue

How about vertices 1 – 4? Does it still work?

Take the MSTApp.java program and replace the Stack with a Queue. Borrow the code for the Queue from the BFSApp.java

Program. Modify the code and then test it.

Once again, submit your program as a WORD Document

and show the testing of vertices 0-4 to see if it works.

Q4) Using the code for the Topological Graph (TopoApp.java attached)

Add the more complicated diagram that we used for the BFS and DFS.

Does it run?

Can you predict what will be output by the program if it does run?