In Dijkstra’s algorithm, what type of graph is required?
a) Undirected graph
b) Graph with non-negative weights
c) Directed acyclic graph
d) Graph with multiple sinks
Welcome!
This community is for professionals and enthusiasts of our products and services.
Share and discuss the best content and new marketing ideas, build your professional profile and become a better marketer together.
This question has been flagged
117
Views
