Topics

Video Image
This video is the first in the series looking at Networks and it's a great one if I do say so myself. There is a lot of langauge we need to ensure we are making with Graphs and Networks and this is the first video where I explain the language which we are going to need for the rest of the module. Simple graphs, Connected Graphs, Planar Graphs, Isolated Vertices, Complete Graphs, Euler's Rule and so much more are covered in this first video of the Networks series.

Video Image
This is the second video in the series looking at Matrices. Knowing how to turn a graph into an adjacency matrix and vice versa is really important in this part of the course. In this video I look at what an adjacency matrix is and how to turn it into a graph. There are a couple of examples and lots of well explained information!

Video Image
This videos looks at everything you need to know about walks, trails, cycles, circuits, paths and so much more. We look at Eulerian Circuits and Eulerian Paths and to make things even more exciting I look at Hamiltonian Circuits and Hamiltonian Cycles. The video has a number of examples which show how to use all the various terms to describe a walk through the country!

Video Image
This is a great video for the Further Maths Units 3 and 4 series of Networks. Having looked at what graphs are and how we can use them, I move onto the idea of the more useful weighted graphs. I look at what a weighted graph is and how to read it. I then move onto the idea of shortest path and how to find it by observation and using Dijkstra's algorithm. Whilst it might seem like Voodoo ... it's actually pretty funky! There are some worked examples explaining the theory all delivered using my unique style.

Video Image
This is another video in the series relating to Networks for the Further Maths course. Moving into more exciting stuff which now looks at using the theory we have learned, I take a look at tress, minimum spanning trees and minimum connector problems. They are all pretty much the same and look at how we can connect vertices in the most efficient ways. I look at using Prim's Algorithm to find the minimum spanning tree with lots of worked examples to show how to apply it.
Select a topic
These are the videos which are available in each chapter. You will notice that some are free and some are for subscribers only. Making and hosting these videos costs a little bit of money. To help pay for the hosting fees I have no choice but to hide some of the videos and make them for subscribers only.