Iterative Algorithm for Finding the Shortest Ways in an Unweighted Undirected Graph
There is a problem of finding the shortest paths between two vertices in an unweighted, undirected graph, which is aggravated by the fact that the available algorithms for finding all paths have a complexity of at least . The proposed new method for finding the shortest path in an unweighted undire...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
The Fund for Promotion of Internet media, IT education, human development «League Internet Media»
2021-09-01
|
| Series: | Современные информационные технологии и IT-образование |
| Subjects: | |
| Online Access: | http://sitito.cs.msu.ru/index.php/SITITO/article/view/786 |