- Step 1OpenTrees & Spanning TreesA tree is connected and acyclic, and a spanning tree contains every vertex of the original graph.
- Step 2OpenMinimum Spanning TreesA minimum spanning tree connects every vertex without cycles at the smallest possible total edge weight.
- Step 3Full accessKruskal's AlgorithmKruskal’s algorithm builds a minimum spanning tree by considering edges in increasing weight order and accepting only those that do not create a cycle.
- Step 4Full accessPrim's AlgorithmPrim’s algorithm builds a minimum spanning tree by repeatedly choosing the cheapest edge joining the current tree to a new vertex.
- Step 5Full accessDijkstra's Shortest-Path AlgorithmDijkstra’s algorithm finds shortest distances from a starting vertex by settling the smallest temporary label and updating its neighbours.
- Step 6Full accessBellman's Principle & Dynamic ProgrammingBellman’s principle finds an optimal policy by combining each immediate cost with the best remaining cost from the next state.
- Step 7Full accessChoosing, Comparing & Justifying AlgorithmsChoose an algorithm by matching its objective and assumptions to the network problem.
- Step 8Full accessProject Scheduling — Critical Path, Early/Late Times & FloatA project's minimum duration is set by its longest dependency path, while forward and backward passes reveal each activity's timing limits.