The Use of Weighted Adjacency Matrix for Searching Optimal Transportation Routes

  • Karel Antoš Department of Informatics and Natural Sciences, Institute of Technology and Business in České Budějovice, Czech Republic


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 of searching for the MST of the graph and completes previously known algorithms of searching for the MST. In the field of transportation it could be succesfully used for solutions of optimizing transportation routes where smallest costs are wanted. Proposed Weighted Adjacency Matrix could be used in similar issues in the field of the graph theory, where graphs with weighted edges are given. The procedure is shown on the attached example.

Keywords: graph theory, minimum spanning tree, Joseph Kruskal, reverse algorithm
Published online
How to Cite
Antoš, K. “The Use of Weighted Adjacency Matrix for Searching Optimal Transportation Routes”, Periodica Polytechnica Transportation Engineering. doi: