An application of graph theory in block planning
A heuristic is an algorithm that more often than not gives nearly the right answer. This study presents three heuristics that are useful in constructing a planar adjacency graph. These are the Deltahedron Heuristic, an algorithm based on Relationship Diagramming Process and a proposed heuristic by t...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
2008
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/5074 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|