Flight-schedule using Dijkstra's algorithm with comparison of routes findings

<span>The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is categorized within the search algorithms. Its purpose is to discover the shortest-route, from the beginning node (origin node) to any node on the tracks, and is applied to both directional and undirected graphs. However, all edges must have non-negative values. The problem of organizing inter-city flights is one of the most important challenges facing airplanes and how to transport passengers and commercial goods between large cities in less time and at a lower cost. In this paper, the authors implement the Dijkstra algorithm to solve this complex problem and also to update it to see the shortest-route from the origin node (city) to the destination node (other cities) in less time and cost for flights using simulation environment. Such as, when graph nodes describe cities and edge route costs represent driving distances between cities that are linked with the direct road. The experimental results show the ability of the simulation to locate the most cost-effective route in the shortest possible time (seconds), as the test achieved 95% to find the suitable route for flights in the shortest possible time and whatever the number of cities on the tracks application.</span>

Analysis of Security Vulnerability Levels of In-Vehicle Network Topologies Applying Graph Representations

This article investigates cybersecurity issues related to in-vehicle communication networks. In-vehicle communication network security is evaluated based on the protection characteristics of the network components and the topology of the network. The automotive communication network topologies are represented as undirected weighted graphs, and their vulnerability is estimated based on the specific characteristics of the generated graph. Thirteen different vehicle models have been investigated to compare the vulnerability levels of the in-vehicle network using the Dijkstra's shortest route algorithm. An important advantage of the proposed method is that it is in accordance with the most relevant security evaluation models. On the other hand, the newly introduced approach considers the Secure-by-Design concept principles.

Fractal movement in the visualisation processes

The article is dedicated to the transformation of learning processes. The causal reasons for the widespread use of the fractal approach in the use of techniques and methods of visualising educational information are considered. The specifics of the use of fractal movement in the organisation of the educational process are described. The role and place of the teacher in the management of transfer and disclosure processes is noted. The fractal organisation of the learning route algorithm is characterised by a markedly deep determinism of the factors that determine the purpose and result of learning. The text notes the conditions of filling the thesaurus of the learner, improving its intellectual property in the form of transmission, assimilation and rejection of information. The elements of the thesaurus formed in the fractal educational field orient both the teacher and the learner to an extended view of a qualitatively in-depth approach to presenting in a specific unity of elements of visualised educational material. The connection between the individual abilities of the teacher and the potential of the learner is been traced. The conditions of the optimal combination of information flow and abilities of the learner, determining the success of training, are highlighted. Positive experience of the implementation of the proposed provisions of the educational process implies further analysis of the mechanisms and procedures of the fractal educational space.

A New Approach to Shortest Route Finding in a Railway Network with Two Track Gauges and Gauge Changeovers

The Spanish railway network is a complex one, due to the existence of standard gauge (1,435 mm), Iberian gauge (1,668 mm), and dual gauge (with three rails) subnetworks, as well as connections between the two first subnetworks (at the so-called gauge changeovers), usable by dual gauge trains. Two of the authors developed a package for shortest route finding, and consumes, costs, and emissions calculations in the Spanish railway network (within the frame of two research projects funded by the Fundación de los Ferrocarriles Españoles–Spanish Railways Foundation). Nevertheless, the approach required from a curious specific algorithm to be developed ad hoc. In this paper, a much simpler approach to shortest route finding in such a network, which merges the three subnetworks into two and considers the gauge changeovers as connections between the two new subnetworks, is detailed. This approach allows to use any standard shortest route algorithm. It has been implemented in the computer algebra system Maple and is applied in this paper both to small specific cases and to the whole Spanish railway network.