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/48195/1/NurAtiqahDinonMFS2013.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|