COMP 251: Elementary graph algorithms

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

Anonymous quiz on lecture 8 on Elementary graph algorithms.

Representation of graphs

We prefer to use an adjacency matrix vs a adjacency list to represent a graph when:

The graph is sparse

The graph is dense

The graph is directed

The graph is a weighted graph

Clear selection

BFS algorithm

Let G be a directed graph. We explore G using the BFS algorithm. Which of the following assertions are true?

All vertices at distance d from the source s are visited before vertices at distance d+1

The best case running time of BFS is Ω(V+E)

All vertices of G are visited even if G has disconnected components

The source s can be any vertex of G

Clear selection

Comments

Enter here any comment/question you would like to make/ask about the material covered in this lecture.

Submit

Clear form

Never submit passwords through Google Forms.

This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy