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

An algorithm that finds the optimal route for cargo package distribution using genetic algorithms.