A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
This article provides a new approach to searching solutions of the ship transport optimalization problems. It brings a new variant of one algorithm of searching for the Minimum Spanning Tree. The new element in the algorithm is that it uses the Weighted Adjacency Matrix. This Weighted Adjacency Matrix is suitable for searching for the Minimum Spanning Tree (MST) of the graph. It shows how it could be used in cases where weighted edges of the graph are given. This creates a new procedure ofdoi:10.3311/pptr.11171 fatcat:gpsnkoc4obe3dewta3wikhljsu