Which of the following graph representations is most efficient for checking if two vertices are adjacent?
Adjacency List
Adjacency Matrix
Incidence Matrix
Edge List
You remove an edge from a connected graph. What is a possible consequence of this action?
The graph may become disconnected.
The number of cycles in the graph will always decrease.
The number of edges and vertices in the graph will decrease.
The graph will always become disconnected.
Which algorithm is typically used to find the shortest path in a weighted graph where edge weights are non-negative?
Depth First Search (DFS)
Breadth First Search (BFS)
Bellman-Ford Algorithm
Dijkstra's Algorithm
In an undirected graph, if the sum of the degrees of all vertices is 30, how many edges are there in the graph?
15
Cannot be determined.
60
30
A cycle in a graph that is not a simple cycle (visits a vertex more than once) is called a:
Path
Trail
Closed Walk
Circuit
Which type of graph is MOST suitable for representing a one-way system on a city map?
Undirected Graph
Directed Graph
Weighted Graph
Tree
Which data structure is commonly used to represent the order of visited vertices during a Depth-First Search?
Queue
Linked List
Heap
Stack
What is a cycle in a graph?
A vertex with a degree of 1.
A path that starts and ends at the same vertex.
The longest path between any two vertices.
A graph that is not connected.
Which data structure is most efficient for checking if an edge exists between two vertices in a sparse graph?
Removing a vertex from a graph also requires you to remove:
All cycles in the graph.
The vertex with the highest degree.
All edges connected to it.
All vertices connected to it.