Skip to content

A Java program that uses the uniform-cost search algorithm to find the shortest path between two nodes. The program includes a unit test for building an edge (connection) between two nodes, printing out the collection of edges a node has, figuring out the shortest path between two nodes, and printing the nodes in the shortest path discovered.

Notifications You must be signed in to change notification settings

n-alex-goncalves/Uniform-Cost-Search

Repository files navigation

Uniform Cost Search Java

This ia a program for Uniform Cost Search implemented into Java.

This program was made during an alternative assessement from the University of Bath due to COVID-19. As such, the majority of the code has been created by the professors. All the code that directly influences the "questions" in the unit testing have been made by me.

About

A Java program that uses the uniform-cost search algorithm to find the shortest path between two nodes. The program includes a unit test for building an edge (connection) between two nodes, printing out the collection of edges a node has, figuring out the shortest path between two nodes, and printing the nodes in the shortest path discovered.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages