Fractal examples of these structures include those named for Cayley describing free groups. The Ford-Fulkerson algorithm solves the max-flow problem, 
Fractal examples of these structures include those named for Cayley describing free groups. The Ford-Fulkerson algorithm solves the max-flow problem, which is defined on these objects. These objects can be described by adjacency matrices, and the Floyd-Warshall algorithm solves the all-pairs (*) shortest path problem on these objects, which were introduced in the Seven Bridges of Königsberg problem. The four color theorem is typically stated in terms of these mathematical objects, whose special cases include trees. For 10 points, name these mathematical objects that consist of a set of vertices and the edges that connect them.
Fractal examples of these structures include those named for Cayley describing free groups.
graphs