Graphs

Question 1

A simple undirected graph in which every pair of distinct vertices is connected by a unique edge, in other words every vertex is directly connected to every other vertex in the graph.

Answer 1

Complete Graph

Question 2

A graph where there exists a simple path from any vertex in the graph to any other vertex in the graph, even if it takes several “hops” to get there.

Answer 2

Connected Graph

Question 3

A graph where an edge has a direction associated with it, for example, a plane flight that takes off in one location and arrives in another. The return flight would be considered a separate edge.

Answer 3

Directed Graph

Question 4

The connection in a graph between two vertices

Answer 4

Edge

Question 5

A data structure in programming (not to be confused with a geometry style graph of a line or a parabola) which consists of a set of vertices (nodes) and edges (connections).

Answer 5

Graph

Question 6

A graph that contains edges between vertices with no specific direction associated with any edge.

Answer 6

Undirected Graph