How to solve Avoiding Airports

Правка en1, от PalForce, 2019-01-01 12:08:42

Avoiding Airports How to solve avoiding airports. I wrote a shortest distance approach using dijkstra but gives TLE. How to avoid going in loops to catch some flight at a particular node that leads to the destination. Can someone give a solution to this problem.

Теги #graphs, shortest path

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский PalForce 2019-01-01 12:08:42 346 Initial revision (published)