Algorithms.. the images are in the attachments

 

1. Give the order in which DFS first visits each vertex in the following digraph. This is called the preorder. (Iterate through the vertices incident from v in increasing order.)

 

 

 

         preorder    0                           

                    ---  ---  ---  ---  ---  ---  ---  ---

 

 

 

 

2. Give the order in which DFS finishes visiting each vertex in the following DAG. This is called the postorder. (Iterate through the vertices incident from v in increasing order.)

 

        postorder                                            0

                    ---  ---  ---  ---  ---  ---  ---  ---  ---  ---

 

 

3. Use the postorder from the previous question to topologically sort the DAG.

 

 

 

topological order         0                            

                    ---  ---  ---  ---  ---  ---  ---  ---  ---  ---

 

    

1. Consider the following weighted undirected graph.

 

List the edges in the MST in the order in which they are discovered by Prim's algorithm, starting the search at A. Since all edge weights are distinct, identify each edge by its weight (instead of its endpoints). (20 Points)

 

 

                                        

            ---  ---  ---  ---  ---  ---  ---  ---

2. Repeat question 1 for Kruskal's algorithm.

 

 

                                        

            ---  ---  ---  ---  ---  ---  ---  ---

3. Explain briefly, but rigorously, why running Kruskal's algorithm with the squares of the weights yields an MST on the original network (with the original weights). Assume all weights are nonnegative.

 

COSC 3304Exercises on Digraphs1.Give the order in which DFSfrstvisits each vertex in the following digraph. This is called thepreorder.(Iterate through the ver±ces incident fromvin increasing order.)preorder0------------------------2.Give the order in which DFSfnishesvisi±ng each vertex in the following DAG. This is calledthepostorder. (Iterate through the ver±ces incident fromvin increasing order.)

• 1495529919-proj2.docx

ComputerScienceExpert

(11)

Status NEW Posted 23 May 2017 08:05 AM My Price 9.00

-----------

Attachments

file 1495529924-Solutions file 2.docx preview (51 words )

H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly -----------onl-----------ine----------- an-----------d g-----------ive----------- yo-----------u e-----------xac-----------t f-----------ile----------- an-----------d t-----------he -----------sam-----------e f-----------ile----------- is----------- al-----------so -----------sen-----------t t-----------o y-----------our----------- em-----------ail----------- th-----------at -----------is -----------reg-----------ist-----------ere-----------d o-----------n -----------THI-----------S W-----------EBS-----------ITE-----------. ----------- Th-----------ank----------- yo-----------u -----------

Not Rated(0)

• Buy Answer