Electric cable line mapping as Non-deterministic Polynomial-time Complete (NPC) is difficult to solve using ordinary linier algorithm. In solving the problem there isn’t a node encounter twice and route must shortest one, ...