-
Notifications
You must be signed in to change notification settings - Fork 1
A Hamiltonian path or traceable path is a path that visits each vertex exactly once. A graph that contains a Hamiltonian path is called a traceable graph. A graph is Hamiltonian-connected if for every pair of vertices there is a Hamiltonian path between the two vertices. A Hamiltonian cycle, Hamiltonian circuit, vertex tour or graph cycle is a c…
prashanth08/Hamiltonian-Cycle-Program
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
Hamiltonian Cycle Program List of Files Description ------------- ------------- README.txt this document manual.txt the manual conditions.txt conditions of use sampleopt.opt example option file sampletest.test example test file Makefile the makefile backtrack.c program source code backtrack.h graphdata.c graphdata.h graphgen.c graphgen.h hamcycle.c hamcycle.h heuristic.c heuristic.h main.c main.h options.c options.h stats.c stats.h tester.c tester.h
About
A Hamiltonian path or traceable path is a path that visits each vertex exactly once. A graph that contains a Hamiltonian path is called a traceable graph. A graph is Hamiltonian-connected if for every pair of vertices there is a Hamiltonian path between the two vertices. A Hamiltonian cycle, Hamiltonian circuit, vertex tour or graph cycle is a c…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published