Pages in this set

Page 1

Preview of page 1
Decisions Maths :- Networks

Route Inspection (Chinese Postman)

Making a route by going over (traverse) all the paths (edges).

Minimum Connector ( Kruskal, Prim network, Prim Matrix)

Making a `tree' by connecting all points and not having any cycles.

Page 2

Preview of page 2
Shortest Path

Make the shortest route linking two points together e.g. A -> B. There is no
need to use all paths (edges).

Travelling Salesperson

Making a single route (cycle) but visiting ALL points.




A fairly good pictoral presentation showing the differences between the different tasks (chinese postman, prims, kruskals, etc.)

Similar Mathematics resources:

See all Mathematics resources »