APPLICATION OF THE ALGORITHM A* TO PATH MINIMIZATION IN A GIVEN HOMOLOGY CLASS |
| 1 | |
| 2014 |
| scientific article | 519.6 | ||
| 262-264 | simplex, polyhedron, homology group, algorithm, minimization, heuristics, algorithm A* |
| Triangulated closed manifolds, their edge paths and modulo 2 homology groups are considered. A modification to the search algorithm for the shortest path (homologous to a given one) based on the use of a heuristic algorithm A* has been developed and practically tested. |
 |