Grafos e Ciclos Hamiltonianos

Lolu hlelo lokusebenza luxazulula inkinga yomjikelezo we-hamiltonian yegrafu enikeziwe. Inkinga iwukuthola izindlela kugrafu eqondisiwe yama-n vertices, kusukela endaweni yokuqala, ukuvakashela wonke ama-vertices kanye kuphela bese ubuyela endaweni yokuqala. Lokhu kwaziwa njengenkinga ye-NP-complete futhi asikho isixazululo esisebenzayo esaziwa ngokujwayelekile. Ngokombono wokufundisa wokuhlela, nginikeza isixazululo samagrafu amancane anamathonsi ayisithupha noma ambalwa, kanye nesixhumi esibonakalayo esisebenziseka kalula.

Ngokuyisisekelo, ibheka zonke izindlela ezingenzeka, kepha indlela ayiyona into encane futhi udinga ukucabanga ngenqubo. Ukusetshenziswa kwezinhlu ezihlukahlukene nemisebenzi ephindaphindayo ekusetshenzisweni kwe-algorithm kuyasiza ekuthuthukiseni amakhono okuhlela. Kufanele futhi ucabangele i-graphic interface yomsebenzisi ukuze ulungise futhi ubonise ihluzo. Umuzwa wokufeza okuthile ozuzwe ngokuqeda lolu hlelo lokusebenza wengeza emthelela wezemfundo. Kuyajabulisa futhi ukusebenzisa uhlelo lokusebenza oluqediwe futhi ubone imiphumela kugrafu.