In ERP contexts, what is Dijkstra's algorithm typically used for?

• A. Sorting employee names.
• B. Graphs model relationships (e.g., dependency graphs). Dijkstra finds the shortest path between nodes; use for logistics routing, workflow optimization, or dependency resolution.
• C. Aggregating sales totals.
• D. Randomly assigning tasks.

Answer: (B)

The idea being tested is using a shortest-path approach to navigate a network. Dijkstra's algorithm finds the minimum-cost or minimum-time path from a starting node to other nodes in a graph with non-negative edge weights. In ERP systems, many problems are modeled as graphs: locations or facilities connected by transfer routes in logistics; tasks and subtasks connected by precedence or dependency links in workflows; or components and their dependencies in product configurations. By applying Dijkstra, you can identify the fastest route for delivering goods, the quickest sequence of dependent manufacturing steps, or the most efficient way to satisfy dependencies to reach a desired state. This makes the algorithm a natural fit for routing, workflow optimization, and dependency resolution. Other options describe activities like sorting, aggregating, or random assignment, which don’t involve path optimization.