Full text loading...
-
The comparison of search algorithms in graph for the problem of determining the optimal trajectory
- Publisher: European Association of Geoscientists & Engineers
- Source: Conference Proceedings, 17th International Conference on Geoinformatics - Theoretical and Applied Aspects, May 2018, Volume 2018, p.1 - 4
Abstract
Summary
The scientific article "The comparison of search algorithms in graphs for the problem of determining the optimal trajectory" illuminates the searching order of the best way in finding the minimal distance in graphs for geological tasks. The algorithms were written on Python for the purpose of this task. The article depicts two algorithms: the breadth-first search (BFS) and the depth-first search (DFS). On the one hand, both of them completely suit for realization of this task, on the other hand, they are simple in writing and executing.
© EAGE Publications BV