Skip to content

This project uses Processing and Graph Theory to generate random Graph patterns and states if they are Euler or Hamilton Graphs. We worked on this as part of our project submission for Graph Theory in Discrete Maths

Notifications You must be signed in to change notification settings

CedricMurairi/euler-hamilton-circuits-simulation

Repository files navigation

DCS_Chapter_4_Euler_Hamilton_Circuits

This project uses Processing to generate random Graph patterns and states if they are Euler or Hamilton Graphs. We worked on this as part of our project submission for Graph Theory in Discrete Maths

Usage

To run this project on your PC, you should have Processing installed from their official website here then follow the instructions bellow:

  • Clone the repository to your local computer
  • CD into the cloned repository and open with Processing or
  • Open the folder you cloned into from Processing environment using your Finder or File Management Syst

Contribution

To be updated soon

About

This project uses Processing and Graph Theory to generate random Graph patterns and states if they are Euler or Hamilton Graphs. We worked on this as part of our project submission for Graph Theory in Discrete Maths

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages