Skip to content

Latest commit

 

History

History
48 lines (31 loc) · 1.68 KB

README.md

File metadata and controls

48 lines (31 loc) · 1.68 KB

Graph Pathfinding Visualizer

Description

A graphical user interface (GUI) application developed using Pygame to visualize Dijkstra's Algorithm for finding the shortest path between nodes in a graph. Users can interactively create nodes, connect them with edges, and visualize the pathfinding process.

Features

  • Node Placement: Click to place nodes.
  • Node Connection: Right-click to create edges between nodes.
  • Pathfinding: Double-click on two nodes to visualize the shortest path.
  • Node Deletion: Press space and click to delete a node.
  • Graph Reset: Middle click to reset the graph.

Visual Demonstrations

  • Placing and Connecting Nodes

    Initial Setup

  • Finding Shortest Path

    Pathfinding Example

  • Complex Graph Configuration

    Complex Graph

  • Solved Path in a Complex Graph

    Solved Complex Path

  • Simple Pathfinding Example

    Simple Solved Path

Installation

Prerequisites

  • Python 3.8 or above
  • Pygame
  • Numpy

Setup

Clone the repository and install the required packages:

git clone https://github.com/your-username/Dijkstra-Path.git
cd Dijkstra-Path
pip install pygame numpy