✨ Traveling between cities using the shortest path, which is similar to the traveling merchant problem, which is a famous problem in mathematics. ✨
- Simple to intermediate pointer use
- Write a module that holds methods together
- Obtaining knowledge of sorting and search algorithms
Map that can travel between cities.
Example output with all paths to be found between the journey, the shortest longest path, and the path to be traveled through at least 3 neighbors
- C programing Language
This requires TDM-GCC 4.9.2 4.9.2 to run.
If you want to filter the image you want, in the pgmimage.h file:
char sourceNode = 'G' /* SourceNode */, destinationNode = 'M';/* Destination Node */You should change the source or destination nodes in the line.
MIT
Free Software, Hell Yeah!