Try this exercise. Is this statement true or false?
Can Dijkstra's algorithm work on both directed and undirected graphs?
Press true if you believe the statement is correct, or false otherwise.
Back to course sections
- Draw a Graph
- The Simple Reference to Graphs Implementing Graphs: Edge List, Adjacency List, Adjacency Matrix Graph Theory: Basic Graph Algorithms Explained Stay On Top of Topological Sort An Illustrated Guide to Dijkstra's Algorithm An Illustrated Guide to Bellman-Ford and Floyd-Warshall Understanding Prim's Algorithm Getting to Know Greedy Algorithms Through Examples What to Know About the Union Find Algorithm Kruskal's Algorithm: Navigating Minimum Spanning Trees What Is The Manhattan Distance?
Mark As Completed Discussion