summary graphs consist of vertices connected by edges graphs can represent many real-world entitiesincluding airline routeselectrical circuitsand job scheduling search algorithms allow you to visit each vertex in graph in systematic way searches are the basis of several other activities the two main search algorithms are depth-first search (dfsand breadth-first search (bfsthe depth-first search algorithm can be based on stackthe breadth-first search algorithm can be based on queue minimum spanning tree (mstconsists of the minimum number of edges necessary to connect all graph' vertices slight modification of the depth-first search algorithm on an unweighted graph yields its minimum spanning tree in directed graphedges have direction (often indicated by an arrowa topological sorting algorithm creates list of vertices arranged so that vertex precedes vertex in the list if there' path from to topological sort can be carried out only on daga directed acyclic (no cyclesgraph topological sorting is typically used for scheduling complex projects that consist of tasks contingent on other tasks warshall' algorithm finds whether there is connectionof either one or multiple edgesfrom any vertex to any other vertex questions these questions are intended as self-test for readers answers may be found in appendix in graphan connects two how do you tellby looking at its adjacency matrixhow many edges there are in an undirected graph in game simulationwhat graph entity corresponds to choice about what move to make