http://namsuck.cafe24.com/projects/theLeastDistance/theLeastDistance.html
Djikstra's algorithm (named after its discover, E.W. Dijkstra) solves the problem of finding the shortest path from a point in a graph (the source) to a destination. It turns out that one can find the shortest paths from a given source to all points in a graph in the same time, hence this problem is sometimes called the single-source shortest paths problem.
Djikstra's algorithm (named after its discover, E.W. Dijkstra) solves the problem of finding the shortest path from a point in a graph (the source) to a destination. It turns out that one can find the shortest paths from a given source to all points in a graph in the same time, hence this problem is sometimes called the single-source shortest paths problem.
Djikstra's algorithm을 이용해 구현해 놓은 소스이다..
아직 UI나 예외처리가 부족하다
-양 남 석-
댓글 없음:
댓글 쓰기