Enhanced prim's algorithm for finding the hamiltonian cycle in a graph
The Travelling Salesman Problem (TSP) is known as one of the oldest combinatorial optimisation problem which solves the path problem in weighted graph. With the main objective to visiting all places (nodes) in a round trip that start and end in one specific place, TSP shared the same problem with a...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2013
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/47935/25/NurAtiqahDinonMFS2013.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|