Skip to content

allows users to place nodes and define paths, with capabilities to search Eulerian and Hamiltonian paths.

License

Notifications You must be signed in to change notification settings

TsitouhRanjafy/path-finding

Repository files navigation

Path finding Latest Tag

GitHub Stars GitHub Forks Last Commit Top Language Language: C Open Issues License


Path Finding

Overview

Path Finding is a cross-platform application built with Tkinter for the user interface and a custom C algorithm for high-performance path computation.
It provides an interactive way to create nodes, connect them with paths, and run advanced graph algorithms with smooth animations.


Features

  • 🖱️ Interactive graph building — users can insert nodes and connect them with paths.
  • 🔍 Find Hamiltonian Path — discover a path that visits each node exactly once.
  • 🔍 Find Eulerian Path — discover a path that visits each edge exactly once.
  • Custom algorithm in C — optimized for speed and efficiency.
  • 🎬 Adjustable animation speed — control how fast the algorithm runs.
  • 📢 Status messages — informs the user with:
    • OK — path found successfully
    • Not Found — no valid path exists
    • Insert Node First — prompt when no nodes are available
    • Node — user clicked the Node button to insert a new node
    • Path — user clicked the Path button to insert a new path
  • 💻 Cross-platform — works on Linux, Windows, and macOS (please verify on your system).

Demo

path_compressed.mp4

About

allows users to place nodes and define paths, with capabilities to search Eulerian and Hamiltonian paths.

Topics

Resources

License

Stars

Watchers

Forks

Packages

No packages published