Solving blocked path problem

Poopćenje pronalaženja najkraćih puteva u nekom kvadratnom prostoru koji sadrži blokade, neprohodne dijelove prostora je problem pronalaska najkraćeg puta u bilo kojem neusmjerenom težinskom grafu u kojem nismo prikazali blokade, jer nemaju nikakvu važnost za algoritam takozvani Dijkstra algoritam. Mnogi praktični problemi se mogu reducirati na problem pronalaska najkraćeg puta. Istražena su rješenja koja heurističkim pristupom ili korištenjem nekonvencionalnih modela računala problem rješavaju u polinomijalnom vremenu. Prikazan je postupak optimalnog rješavanja poopćenog problema pronalaženja najkraćih puteva korištenjem algoritama pretraživanja. Algoritmi pretraživanja su implementirani u Pythonu. Rezultati njihovog izvršavanja su analizirani i praktički je dokazana vremenska složenost oblikovanih algoritama.The fading of the shortest paths in a square area containing blockages, inadequate parts of the space, is the problem of finding the shortest path in any unedited weight graph in which we did not show blockages because they do not have any importance for the algorithm of the so-called Dijkstra algorithm. Many practical problems can be reduced to the problem of finding the shortest path. Solutions were explored by using a heuristic approach or using unconventional computer model problems in polynomial time. An optimum solution to the problem of finding the shortest path using search algorithms is presented. Search algorithms are implemented in Python. The results of their execution were analyzed and the time complexity of algorithms has practically been proved