Hi Everyone,
This is the twelfth of 14 videos covering the new Networks topic for year 11/12 Standard Maths HSC.

Part 1 - Introduction to Networks. What is a network, degree, connected, non connected or isomorphic networks. All explained here
[ Ссылка ]

Part 2 = What is a path, walk, circuit, trail and cycle in Networks?
[ Ссылка ]

Part 3 = What is a Spanning tree??
[ Ссылка ]

Part 4 = Networks , Eularian path and Circuit
[ Ссылка ]

Part 5 = Weighted networks 
[ Ссылка ]

Part 6 = Activity Charts Part 1
[ Ссылка ]

Part 7 = Activity Charts Part 2
[ Ссылка ]

Part 8 = Activity Charts Part 3
[ Ссылка ]

Part 9= Drawing a table fro a Network diagram
[ Ссылка ]

Part 10 = Kruskal's Algorithm
[ Ссылка ]

Part 11 = Prim's Algorithm for finding a minimum spanning tree
[ Ссылка ]

Part 12 = Forward and backward scanning to find the critical path and float times
[ Ссылка ]

Part 13 = Forward and backward scanning  part 2 to find the critical path and float times
[ Ссылка ]

Thanks for watching

Good Luck...!!!
Heidi Postle
A Plus Maths
heidipostle@gmail.com

свернуть