Skip to content

Edopramudya/Uniform-Cost-Search

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

3 Commits
Β 
Β 
Β 
Β 

Repository files navigation

Nearest Parking Finder πŸš—

This project implements the Uniform Cost Search (UCS) algorithm to determine the nearest parking location from a starting point on a campus. It provides both textual results and a graphical visualization of the path and costs.


Features ✨

  • Finds the nearest parking node based on user input.
  • Visualizes the graph with highlighted paths and costs using Matplotlib.
  • Highlights:
    • Yellow: Starting node.
    • Red: Nearest parking node.
    • Green: Other parking nodes.

How It Works βš™οΈ

  1. Input your starting location (A-K).
  2. The program calculates:
    • The nearest parking node.
    • The path and total cost.
  3. Outputs both the result and a graph visualization.

Installation πŸ”§

  1. Clone the repository.
  2. Install Matplotlib (pip install matplotlib).
  3. Run the program to find your nearest parking.

License πŸ“œ

This project is licensed under the MIT License.

About

Uniform Cost Search for Nearest Parking Finder This project implements the Uniform Cost Search (UCS) algorithm to determine the nearest parking location from a given starting point in a campus area. The graph is manually represented, and the result is visualized using Matplotlib.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages