LEARNING OBJECTVIE: To apply Prims algorithm to find minimum spanning tree AND Dijkstra's algorithm for finding the shortest path between two vertices in a network.
SUCCES CRITERIA: You Will be able to apply both algorithms to networks to solve problems.
LESSON: PRIMS Algorithm 1, Prims Algorthim 2
Exercise 3B and 3C to be completed for Homework
PLENARY: Check on understanding of both ways of applying Prims Algorithm
No comments:
Post a Comment