Design a BFS-based algorithm for directed graph that computes the shortest distance from vertex srcU to vertex destV

Give an efficient algorithm to solve the single-destination shortest paths problem

 

Order Now
SKU: Ques34

1.The single-destination shortest path problem for a directed graph is to find the shortest path from every other vertex to a specified vertex destV. Give an efficient algorithm (pseudo code) to solve the single-destination shortest paths problem.

 

2.Design a BFS-based algorithm (pseudo code) for directed graph that computes the shortest distance (or the least number of vertices in-between) from vertex srcU to vertex destV.

 

3. Consider a hash table of size 7 with hash function h(k)=k mod 7. Draw the table that results after inserting, in the given order, the following values: 19, 26,13,48,17 with respect to following three different scenario: (1) the collision is handled by separate chaining; (2) the collision is handled by linear probing; (3) the collision is handled by double-hashing using a second hash function: h* = 5 – (k mod 5). (Notes: several techniques involved in this question were not emphasized in the class, you have to master them via slides or check the document in BlackBoard)

 

4.Design an algorithm (pseudo code) that returns the SECOND largest key value of a Black-Red Tree. In addition, you can use diagrams to demonstrate that your algorithm make sense.

 

 

Reviews

There are no reviews yet.

Be the first to review “Design a BFS-based algorithm for directed graph that computes the shortest distance from vertex srcU to vertex destV”

Your email address will not be published. Required fields are marked *

Sorry no more offers available