[问答题]
The distances by road, in k
s3pn(wnx.;rx0nd os4b30 l evilometres
xy p.h4 .b*d,cm u5rik, between six cities in the Netherlands are shown in the following table
h,ym5rkx u4c .d*.i bp.
A telecommunications company has gained approval to connect the six cities with fiber optic cabling along the road system.
1. Using Kruskal's algorithm, calculate the minimum length of fiber optic cable needed for all six cities to be connected to the fibre optic network.
Visitors to the Netherlands can travel between cities on a train network represented by the following graph.
2. State, justifying your answer, whether the graph has any Hamiltonian:
(1) paths;
(2) cycles.
3. State, justifying your answer, whether the graph has any Eulerian:
(1) trails;
(2) circuits.
Clare plans to visit the Netherlands. She wants to arrive in Eindhoven, travel all the available train routes exactly once, and then depart from Amsterdam.
4. Find the route between two cities Clare will need to travel by an alternate method of transport in order to make this possible.
