Graphs in maritime transports Cristina Dragomir Constanta Maritime University, Romania cristina.dragomir@cmu-edu.eu Manole Ionuț-Constantin “Kemal Ataturk” National College, Medgidia, Romania manole.ionut@gmail.com Abstract. The rapid development of graph algorithms was primarily due to exponential progress known from the development of computers. Requested to participate in the process of combinatorial optimization, graphs¸ built a fund of theorems based on which a lot of algorithms have been developed that today form the toolbasic of this field. Applications of graph algorithms in various domains, from substantiating political decisions to macroeconomic issues, from production problems in the study of electrical networks, gives it an increased importance. Keywords. Graphs, maritime routes, paths, algorithm, nodes, edges. 1. Introduction Our general objective is the modeling of the many situations in everyday life using graph theory. The specific objective of this article is finding the shortest path in a graph in order to design a solution to a practical problem: determining the shortest path between two points using Dijkstra's algorithm for use in a maritime network transport route model. To achieve this specific objective, a network [1] based transport model must be analyzed to minimize transport costs. Dijkstra's algorithm is usefull in determining a minimum cost path from a start node to each of the other vertices of the graph. The algorithm [3] can be explained on a weighted graph. At the initial time the only peak for which the minimum cost path is known is the initial peak. The following structures can be used: - a set that will retain the peaks for which the minimum cost road is already calculated; - a vector whose size is given by the number of nodes in the graph and which stores the cost of the minimum cost path from the starting node to any node, a path that passes only through vertices from the set of selected vertices; - a vector that holds for each vertex in the graph the vertex that precedes it on the minimum cost path. 6 Technium Vol. 2, Issue 4 pp.6-12 (2020) ISSN: 2668-778X www.techniumscience.com