Tag: shortest path

This quiz covers the fundamental concepts of Network Flows and Optimization, including topics such as maximum flow, minimum cost flow, and shortest path algorithms.

This quiz covers fundamental concepts and algorithms related to graph theory, including graph traversal, shortest path finding, and graph connectivity.

This quiz is designed to test your understanding of Greedy Algorithms. Greedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum. They are often used to solve optimization problems, such as finding the shortest path, the maximum flow, or the minimum spanning tree.