Different Searching algorithms (DFS, BFS, IDS, Greedy, A*) opting to find optimal path from source to destination
Java-based project that implements Kruskal's algorithm to build a cost-efficient railroad network connecting multiple cities. Given a list of tracks with associated costs, it identifies the minimum spanning tree, ensuring all cities are connected with the minimum possible total cost
Time-Based Orienteering Solver
An algorithm that finds the optimal route for cargo package distribution using genetic algorithms.
Ski Orienteering Path Optimizer
Add a description, image, and links to the optimal-path topic page so that developers can more easily learn about it.
To associate your repository with the optimal-path topic, visit your repo's landing page and select "manage topics."