Graphs

In a graphical depiction of a graph, what does a vertex represent?

In a graphical depiction of a graph, what does an edge represent if it’s unidirectional?

In a graphical depiction of a graph, what does an edge represent if it’s bidirectional?

What two components make up a graph?

What are vertices that are connected by an edge called?

What is a graph called if it has a value for each edge?

What is a graph called if its edges are depicted with arrows?

What is a graph called if its edges are depicted with lines?

What is a graph called if the path between any two vertices is 1?

What are two ways to internally represent graphs?

In an adjacency list, is space reserved for edges that do not exist?

Does an adjacency matrix use less memory than an adjacency list?

Using an adjacency list, do you need to search the entire list to determine if an edge exists between two given vertices?

In an adjacency matrix, can you use an edge weight of infinity to represent no edge between two vertices?

Are all graphs trees but not all trees graphs?

Can vertices in a graph have only one topological order?

In a weighted graph, does the shortest path between two vertices have the largest edge-weight sum?

Is a topological order possible for a graph that has a cycle?