• Finding the optimal path betwe...

Treffer: Finding the optimal path between two points on a field in the form of a cellular maze

Title:
Finding the optimal path between two points on a field in the form of a cellular maze
Authors:
Yurii Milovidov, NULES of Ukraine, Kyiv
Source:
Глобальні та регіональні проблеми інформатизації в суспільстві і природокористуванні; ГЛОБАЛЬНІ ТА РЕГІОНАЛЬНІ ПРОБЛЕМИ ІНФОРМАТИЗАЦІЇ В СУСПІЛЬСТВІ І ПРИРОДОКОРИСТУВАННІ ’2023
Publisher Information:
GLOBAL AND REGIONAL PROBLEMS OF INFORMATIZATION IN SOCIETY AND NATURE USING
Глобальні та регіональні проблеми інформатизації в суспільстві і природокористуванні
Publication Year:
2023
Subject Terms:
Algorithms and data structures, Object-oriented programming, Depth First Search, Breadth First Search, Dijkstra’s algorithm
Document Type:
Fachzeitschrift article in journal/newspaper
Language:
English
Relation:
http://econference.nubip.edu.ua/index.php/grpi/grpi23/paper/view/3144
Availability:
http://econference.nubip.edu.ua/index.php/grpi/grpi23/paper/view/3144
Rights:
Authors who submit to this conference agree to the following terms: a) Authors retain copyright over their work, while allowing the conference to place this unpublished work under a Creative Commons Attribution License , which allows others to freely access, use, and share the work, with an acknowledgement of the work's authorship and its initial presentation at this conference. b) Authors are able to waive the terms of the CC license and enter into separate, additional contractual arrangements for the non-exclusive distribution and subsequent publication of this work (e.g., publish a revised version in a journal, post it to an institutional repository or publish it in a book), with an acknowledgement of its initial presentation at this conference. c) In addition, authors are encouraged to post and share their work online (e.g., in institutional repositories or on their website) at any point before and after the conference.
Accession Number:
edsbas.6FD25B5A
Database:
BASE

Weitere Informationen

A computer program developed by the author to demonstrate the operation of algorithms for finding the shortest path on a site in the form of a cellular labyrinth is presented. A path between cells can have different weights. Dijkstra's algorithm for a weighted graph is used to find the shortest path.