Implicit Graph

Implicit Graphs:

Some graphs don't need to be stored or explicitly generated for the graph to be traversed or operated upon. Such graphs are called as Implicit graphs.

Implicit graphs come in two flavors:

1. The edges can be determined easily: Example: The graph of chess knight movements on an 8*8 chessboard. The vertices are the cells in the chessboard. Two squares are connected if they differ by two squares horizontally and one vertically( or the other way round).
2. The edges can be determined with some rules: Example: A graph contains N vertices. There is an edge between two vertices i and j if (i+j) is a prime.