A collection of unordered lists used to represent a finite graph.1 Each unordered list describes the set of neighbours of a node in the graph.
Examples
This graph can be represented by three unordered lists: {b, c}, {a, c}, {a, b}.
1 min read
A collection of unordered lists used to represent a finite graph.1 Each unordered list describes the set of neighbours of a node in the graph.
This graph can be represented by three unordered lists: {b, c}, {a, c}, {a, b}.