4 Solution Methods Dijkstra algorithm: Using QM: Introduced in book. Not required for this courseUsing QM:Required for this courseData input format -
5 DiscussionWhat if the ‘cost’, instead of ‘distance’, between two nodes are given, and we want to find the ‘lowest-cost route’ from a starting node to a destination node?What if the cost from a to b is different from the cost from b to a? (QM does not handle this situation.)
6 Minimal Spanning Tree Problem Given costs (distances) between nodes, find a network (actually a “tree”) that covers all the nodes with minimum total cost.Applications:
8 Shortest Route vs. Minimal Spanning The minimal spanning tree problem is to identify a set of connected arcs that cover all nodes.The shortest route problem is to identify a route from a particular node to another, which typically does not pass through every node.
9 Maximal Flow ProblemGiven flow-capacities between nodes, find the maximum amount of flows that can go from the origin node to the destination node through the network.Applications: