Week 6: Graphs

Question 1

What is a graph?

Answer 1

Question 2

What are the following:

Directed edge

Undirected edge

Directed graph or digraph

Undirected graph

Mixed graph

Answer 2

Question 3

What are the following:

End vertices (or endpoints) of an edge

Edges incident on a vertex

Adjacent vertices

Degree of a vertex

PArallel edges

Self-loop

Simple graph

Answer 3

Question 4

What are the following:

path

simple path

Answer 4

Question 5

What are the following:

Cycle

Simple cycle

Answer 5

Question 6

What are the properties of a graph?

Answer 6

Question 7

What is a complete graph/clique?

Answer 7

Question 8

What is a connected graph?

Answer 8

Question 9

What is a tree?

Answer 9

Question 10

What is a forest?

Answer 10

Question 11

What is a subgraph?

Answer 11

Question 12

What is a connected component?

Answer 12

Question 13

Example of connected components:

Answer 13

Answer: 3

Question 14

What is the Edge List DS for storing a graph?

Answer 14

Question 15

What is the Adjacency List DS for storing a graph?

Answer 15

Question 16

What is the Adjacency Matrix DS for storing a graph?

Answer 16

Question 17

What is the performance of the following three DSs for graphs:

Edge List

Adjacency List

Adjacency Matrix

Answer 17