Implicit graph

In the study of graph algorithms, an implicit graph representation (or more simply implicit graph) is a graph whose vertices or edges are not represented as explicit objects in a computer's memory, but rather are determined algorithmically from some other input, for example a computable function.

Each vertex of the implicit graph is defined by a square on the board, and each edge is a move in the knight's tour.

From Wikipedia, the free encyclopedia · View on Wikipedia

Developed by Nelliwinne