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 algorithms are used on these objects, which may be used (-5[1])to construct (-5[1])a static schedule by building one of these (15[1])objects. In (15[1])2015, László Babai announced work (15[1])on a problem named for these objects (-5[1])that runs in quasipolynomial time. (10[1])The expression (10[1]-5[1])D (-5[1])minus A (10[1])gives (10[1]-5[1])a type of (*) Laplacian representing these objects. (10[1])One of these objects that obeys the triangle inequality is used as input (10[1]-5[2])for the Christofides algorithm. Kruskal’s algorithm constructs a minimum spanning tree (10[1])on these objects, which may be used for causality diagramming (10[1])in their directed acyclic form. For 10 points, name these objects that (10[2])consist of a collection of vertices (10[1])connected by edges. ■END■