Q7 (a). Explain directed graph and non directed graph in your own wording. Given a graph in Figure 4 where, G = (V, E) with a source vertex s, weight function w, edges are non - negative and directed.
The objective is to find shortest path by using Dijkstra’s Algorithm from s to every vertex u V.
Q7 (b). What a re the average case performances (big - O) for the following sequential sorting algorithms?
Selection Sort _______ Insertion Sort ________
Heap Sort __________ Merge Sort__________
Quick Sort __________
Attachments:
Answers
Answered by
0
Answer:
where is the graph
Explanation:
Similar questions