Data Structure Questions and Answers-Directed Graph
Dijkstra's Algorithm will work for both negative and positive weights?
Question 1 Explanation:
Dijkstra's Algorithm assumes all weights to be non-negative.
A graph having an edge from each vertex to every other vertex is called a .....
Question 2 Explanation:
This is a part of the nomenclature followed in Graph Theory.
What is the number of unlabeled simple directed graph that can be made with 1 or 2 vertices?
Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of .....
Question 4 Explanation:
The Algorithm uses Dynamic Programming and checks for every possible path.
All Graphs have unique representation on paper.
Question 5 Explanation:
Same Graph may be drawn in different ways on paper.
There are 5 questions to complete.