Podcast
Questions and Answers
Which data structure represents the graph as a n x n matrix?
Which data structure represents the graph as a n x n matrix?
- Adjacency list structure
- Adjacency matrix structure (correct)
- Augmented vertex object
- Edge list structure
For large graphs, which representation typically requires too much storage?
For large graphs, which representation typically requires too much storage?
- Adjacency matrix structure (correct)
- Adjacency list structure
- Edge list structure
- Edge object reference
In which type of graphs is the adjacency list often a more appropriate representation?
In which type of graphs is the adjacency list often a more appropriate representation?
- Densely connected graphs
- Sparse graphs
- Eulerian graphs
- Planar graphs (correct)
What does a graph consist of?
What does a graph consist of?
What type of edges are represented by an ordered pair of vertices?
What type of edges are represented by an ordered pair of vertices?
What are the endpoints of an edge called?
What are the endpoints of an edge called?
What does the function numVertices() do in the context of a graph?
What does the function numVertices() do in the context of a graph?
Which function should be used to get an iteration of all the edges of the graph?
Which function should be used to get an iteration of all the edges of the graph?
In a directed graph, which function should be used to get the number of incoming edges to a specific vertex?
In a directed graph, which function should be used to get the number of incoming edges to a specific vertex?
What does the function endVertices(e) do in the context of a graph?
What does the function endVertices(e) do in the context of a graph?
Flashcards are hidden until you start studying
