Synthesis of the internodal network

3.3.1 Study sub item 2.1, 2.3.4 of the Key statements.

3.3.2 Define the contour of the least length merging internodal telecommunication network points into the hoist ring.

There given: location of points (n =10), the circuit design of the linearly-cable conduit presented as weight matrix of graph ribs representing a network. Weight characteristics of ribs match to distances in kilometres of linearly-cable constructions between network points. Use the weight matrix obtained while performing the Task 3.1 as mentioned matrix.

Remarks. For the problem solution it is possible to take advantage of heuristic algorithm of «the problem about the travelling salesman» solving. As heuristics it is possible to use the rule shown in the item 2.3.4, or to formulate a heuristic rule independently.

3.3.3 Show the obtained solution and the explanation to it in an explanatory note.

3.3.4 Answer the following key questions in writing:

- What does «the problem about the travelling salesman» consist in?

- What is the exact solution of «the problem about the travelling salesman»?

- What contour is called Hamiltonian cycle?

- What is called as heuristics? What algorithms refer to the heuristic ones?

- Formulate advantages and disadvantages of exact and heuristic algorithms.