First 44 words of the document:
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.
Other pages in this set
Here's a taster:
Make the shortest route linking two points together e.g. A -> B. There is no
need to use all paths (edges).
Making a single route (cycle) but visiting ALL points.…read more