Complete the sentence to describe a directed graph.
In a directed graph, edges have a [1] indicating the direction from one vertex to another.
Directed graphs have edges with a direction, showing the path from one vertex to another.
Complete the sentence to describe an undirected graph.
In an undirected graph, edges [1] have a direction and connect vertices symmetrically.
Undirected graphs have edges without direction, meaning the connection is mutual between vertices.
Fix the error in the statement about edges in directed graphs.
Edges in a directed graph are [1] and can be traversed in both directions.
Edges in directed graphs have a direction and cannot be traversed both ways unless there is a reverse edge.
Fill both blanks to complete the definition of adjacency in graphs.
In an undirected graph, two vertices are adjacent if they are connected by an [1]. In a directed graph, vertex A is adjacent to vertex B if there is an [2] from A to B.
In undirected graphs, adjacency means connected by an edge. In directed graphs, adjacency means there is an arc (directed edge) from one vertex to another.
Fill all three blanks to complete the description of graph types and edge properties.
A [1] graph has edges with a [2] showing direction, while an [3] graph has edges without direction.
A directed graph has edges with direction, often shown by an arrow. An undirected graph has edges without direction.