Directed Graphs and Adjacency Matrices

The video tutorial explains directed graphs, also known as digraphs, where edges have a set direction, useful for modeling one-way systems like roads or electricity flow. It covers the concept of adjacency matrices, detailing how to list vertices and determine connections between them. The tutorial guides viewers through creating and interpreting adjacency matrices, emphasizing the lack of symmetry in digraphs and the importance of following rules for clarity.

What is another name for a directed graph?

• Digraph

• Complete graph

• Undirected graph

• Bipartite graph

Which of the following is a practical application of a digraph?

• Symmetrical networks

• Undirected social networks

• Two-way streets

• One-way roads

In a directed graph, what does each edge have?

• A label

• A weight

• A color

• A set direction

How does an adjacency matrix for a directed graph differ from that of an undirected graph?

• It is always symmetrical

• It may not be symmetrical

• It uses different symbols

• It is larger in size

What is the significance of the leading diagonal in an adjacency matrix for a digraph?

• It represents loops

• It is always filled with ones

• It is always filled with zeros

• It represents the number of vertices

When listing vertices in an adjacency matrix, what do the rows and columns represent?

• Both rows and columns represent destinations

• Rows represent origins, columns represent destinations

• Both rows and columns represent origins

• Rows represent destinations, columns represent origins

How many direct paths are there from A to B in the given example?

• Three

• None

• One

• Two

What is the value in the adjacency matrix for a direct path from C to A?

• Three

• Two

• One

• Zero

In the example, how many paths are there from D to C?

• One

• None

• Two

• Three

What is the first step in creating an adjacency matrix for a directed graph?

• Drawing the graph

• Listing all vertices

• Listing all edges

• Counting the edges