weighted graphs and networks, and the shortest path problem
find the shortest path in a weighted graph (solution by inspection only)
construct graphs, digraphs and networks and their matrix equivalents to model and analyse practical situations
