galsor / kbnpathfinder Goto Github PK
View Code? Open in Web Editor NEWThis project implements a graph algorithm provinding a suboptimal solution to the knapsak problem in a geographical context. The decisions are driven by the maximization of a regional score. The node with the best regional score is selected as the next node to visit. The algorithms process recursively to find the K Best Nodes (KBN) to visit.
License: MIT License