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. == Neighborhood representations == The notion of an implicit graph is common in various search algorithms which are described in terms of graphs.
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. == Neighborhood representations == The notion of an implicit graph is common in various search algorithms which are described in terms of graphs.
Source: Wikipedia "Implicit graph" · CC BY-SA 4.0
Share this article: X · Bluesky