Is the graph connected?
hat will be an ideal response?
Consider the following undirected graph.
vertices: A, B, C, D, E
edges: (A,B),(C,D), (B,D), (B,C)
The graph is not connected, because there is no path between the node labeled E and any of the other
vertices.
Computer Science & Information Technology
You might also like to view...
A primary key field that uses two or more fields is known as a __________.
a. simple primary key b. composite primary key c. foreign key d. candidate key
Computer Science & Information Technology
Which clause is used to filter non aggregate data?
a. SELECT b. FROM c. WHERE d. GROUP BY e. HAVING
Computer Science & Information Technology