For a system of tasks that may lock resources, the “wait-for” one of these constructs can be used to represent the system state and identify deadlocks. Weisfeiler-Leman (15[1])algorithms are used on these objects, (15[1])which may be used to construct a static schedule by building one of these objects. (15[1])In 2015, László Babai announced work on a problem named for these objects (15[1])that runs in quasipolynomial (15[1])time. (-5[1])The expression D minus A gives a type of (*) Laplacian representing these objects. One of these objects that obeys the triangle inequality is used as input for the Christofides algorithm. Kruskal’s algorithm constructs (-5[1])a (-5[1])minimum spanning (-5[1])tree on these (10[1])objects, which may be used for causality diagramming in their directed (10[2])acyclic (10[1])form. (10[1])For 10 points, name these objects (10[1])that consist of a collection of vertices (10[1])connected by edges. ■END■ (10[3]0[1])