Skip to content

Latest commit

 

History

History
12 lines (7 loc) · 462 Bytes

README.md

File metadata and controls

12 lines (7 loc) · 462 Bytes

PATHFINDING

Pathfinding algorithm made for the Artificial Intelligence discipline for class work purpose.

This software project was developed in the NetBeans.

This system performs Dijkstra calculations to find the shortest path between two cities. For this, the cities (nodes) are converted from the txt file to a graph, through the Java language and then performed the necessary calculations.

License

Unlicensed software.

https://github.com/ademarazn