1887

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.

Loading

Article metrics loading...

/content/papers/10.3997/2214-4609.201801871
2018-05-14
2024-03-29
Loading full text...

Full text loading...

References

  1. Stein, K., Rivest, R.L., Corman, T., Leizerson, C.E.
    [1990]. Leiseron Algorithms: construction and analysis. 456–464 pp.
    [Google Scholar]
  2. Everit. Tom., Hutter, Marcus.
    [2015]. Analytical Results on the BFS vs. DFS. Algorithm Selection Problem. Australian National University, Canberra, Australia. P. 3–6
    [Google Scholar]
http://instance.metastore.ingenta.com/content/papers/10.3997/2214-4609.201801871
Loading
/content/papers/10.3997/2214-4609.201801871
Loading

Data & Media loading...

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error