oguzhangoller / a-search-algorithm-implementation Goto Github PK
View Code? Open in Web Editor NEWA* is an algorithm used for path finding and graph traversal. This program illustrates the logic of this algorithm by applying it on cities and distances between them. Given cities and connections between them, program is expected to find shortest distance between given cities using distances.