The Possibility of Application of Algorithms Indicating Maximum Paths in Directed Graphs for Modeling of the Evacuation Process

In the introduction, ways of accounting geometrical, population, environment and procedure parameters in the computer evacuation simulating programs have been shown. In the part to follow the meth-od for graph theory based representation of the geometry of escape routes has been described. Besides, means of indicating the longest time of emergency evacuation is proposed using a modified Warshall’s algorithm to find the maximum weights in the directed graph. The use of the algorithm to indicate maximum escape routes makes it possible to verify the arrangement of escape routes in newly designed or existing ships.