Path Finding Visualization
교육
무료 · iPad용으로 디자인됨
Want to see various pathfinding algorithms in action? With Path Finding Visualization, you can visualize, in action, six different algorithms. This app allows you to select your own starting and ending points, select the algorithm you want to use, and add walls in order to create boundaries.
This app includes the following algorithms:
Dijkstra's - Works by expanding outwards until it reaches the target node. Guaranteed to find the shortest path as long as there are not any negative weights.
Bidirectional Dijkstra's - Dijkstra's algorithm from both sides.
A* - Like Dijkstra's in that it favors nodes close to the starting point, but also favors nodes close to the ending point (heuristic). It does not guarantee the shortest path. A tie-breaker that prefers straight lines was included in order to prevent multiple nodes from having the same F values.
Bidirectional A* - The A* algorithm from both sides.
Breadth-First Search - Traverses through a graph one level at a time until it finds the target node. Since there are no weights, this algorithm does guarantee the shortest path.
Depth-First Search - Traverses through a graph by going as deep as possible and then backtracking until it finds the target node. It does not guarantee the shortest path.
Learning about or want to visualize any of the above algorithms in action? Download Path Finding Visualization today and have a better understanding of how each algorithm works.
평가 및 리뷰
Dark Mode Support
Josh Sauder 개발자가 아래 설명된 데이터 처리 방식이 앱의 개인정보 처리방침에 포함되어 있을 수 있다고 표시했습니다. 자세한 내용은 개발자의 개인정보 처리방침 을 참조하십시오.
데이터가 수집되지 않음
개발자가 이 앱에서 데이터를 수집하지 않습니다.
손쉬운 사용
개발자가 이 앱이 지원하는 손쉬운 사용 기능을 아직 등록하지 않았습니다. 더 알아보기
정보
- 판매자
- Josh Sauder
- 크기
- 34.2 MB
- 카테고리
- 교육
- 호환성
iOS 15.1 이상 필요
- iPhone
iOS 15.1 이상 필요 - iPad
iPadOS 15.1 이상 필요 - iPod touch
iOS 15.1 이상 필요 - Mac
macOS 12.0 이상 및 Apple M1 칩 이상이 탑재된 Mac이 필요 - Apple Vision
visionOS 1.0 이상 필요
- 언어
- 영어
- 연령 등급
4+
- 4+
- 저작권
- © Josh Sauder