For 10 points, give these constructs, sets of points with edges between them, which some people may draw with x or y axes.
Mathematically, these entities have a chromatic number, and they are operated on by the Floyd-Warshall algorithm. The recursive "flood fill" algorithm can be used to determine the number of their connected components, and if they are connected and acyclic, they are called trees. The shortest path along one can be determined using (*) Djikstra's [jike-struh's] algorithm, and they can be represented using adjacency matrices or adjacency lists, which list for each vertex the vertices they are connected to. For 10 points, give these constructs, sets of points with edges between them, which some people may draw with x or y axes.
Mathematically, these entities have a chromatic number, and they are operated on by the Floyd-Warshall algorithm.
graphs