Exam 20: Graphs

A(n)____________________ graph G is called strongly connected if any two vertices in G are connected.

A tree in which a particular vertex is designated as a root is called a(n)____ tree.

A binary tree has no cycles.

Let G be an undirected graph.Let u and v be two vertices in G.Then u and v are called ____ if there is an edge from one to the other.

In a(n)____________________ graph,the tail of a pictorial directed edge is the origin,and the head is the destination.

In a graph G,if the edges connecting two vertices have weights assigned to them,the graph is called a ____ graph.

A graph G is a pair,G = (V,E),where V is a finite nonempty set called the set of ____ of G,and the elements of E are the pairs of elements of V.

A graph H is called a(n)____ of G if V(H)is a subset of V(G)and E(H)is a subset of E(G); that is,every vertex of H is a vertex of G,and every edge in H is an edge in G.

A minimal spanning tree of G is a spanning tree with the minimum ____.

Linked lists cannot be used to implement an adjacency list.