Solution of ahortest paths in non-euclidean farey graph with floyd-warshall algorithm
| dc.authorid | 0000-0002-6933-8494 | |
| dc.contributor.author | Gökcan, İbrahim | |
| dc.date.accessioned | 2025-10-09T05:39:59Z | |
| dc.date.available | 2025-10-09T05:39:59Z | |
| dc.date.issued | 2025 | |
| dc.department | AÇÜ | |
| dc.description.abstract | Algorithm applications on graphs are intensively researched. Graph theory systematizes complex and difficult problems and algorithms provide fast and clear solutions, which increases interest in the discipline. The Floyd-Warshall algorithm determines the shortest paths between all the vertices in a graph. In this paper, we consider the Floyd-Warshall algorithm on the Farey graph defined in a non-Euclidean hyperbolic space. A Farey graph with 15 edges and 9 vertices is constructed and the shortest paths from all vertices to other vertices are detected. By defining the weight between consecutive vertices, the shortest paths between the vertices are measured in terms of the number of steps. | |
| dc.identifier.doi | 10.29233/sdufeffd.1591711 | |
| dc.identifier.endpage | 74 | |
| dc.identifier.issue | 1 | |
| dc.identifier.startpage | 63 | |
| dc.identifier.uri | https://hdl.handle.net/11494/6011 | |
| dc.identifier.volume | 20 | |
| dc.indekslendigikaynak | TR-Dizin | |
| dc.institutionauthor | Gökcan, İbrahim | |
| dc.institutionauthorid | 0000-0002-6933-8494 | |
| dc.language.iso | en | |
| dc.publisher | Süleyman Demirel Üniversitesi | |
| dc.relation.ispartof | Süleyman Demirel Üniversitesi Fen Edebiyat Fakültesi Fen Dergisi | |
| dc.relation.publicationcategory | Makale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanı | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | Farey graph | |
| dc.subject | Floyd-Warshall algorithm | |
| dc.subject | non-Euclidean hyperbolic space | |
| dc.title | Solution of ahortest paths in non-euclidean farey graph with floyd-warshall algorithm | |
| dc.type | Article |
