the memory use of an adjacency matrix is (ao( (bo( (co( (do(log the term optimal can mean (ashortest (bcheapest (cfastest (dall of these how many articulation vertices does biconnected graph contain( ( ( ( kruskal' algorithm is an example of greedy algorithm true or false graph with multiple edges and/or loop is called graph is linear data structure in-degree of node is the number of edges leaving that node the size of graph is the total number of vertices in it sink has zero in-degree but positive outdegree the space complexity of depth-first search is lower than that of breadth-first search node is known as sink if it has positive outdegree but the in-degree directed graph that has no cycles is called directed acyclic graph graph can have many different spanning trees fringe vertices are not part of tbut are adjacent to some tree vertex fill in the blanks has zero degree in-degree of node is the number of edges that at adjacency matrix is also known as path is known as path if the edge has the same end-points vertices that are part of the minimum spanning tree are called of graph is constructed to answer reachability questions an is vertex of if removing along with the edges incident to results in graph that has at least two connected components graph is connected graph that is not broken into disconnected pieces by deleting any single vertex an edge is called if removing that edge results in disconnected graph