01What is an Adjacency Matrix?
02When is an Adjacency List preferred over a Matrix?
03What is a 'DAG'?
04In a directed graph, 'In-degree' refers to:
05What are 'Weights' in a graph?
06A 'Complete Graph' is one where:
07What does 'Strongly Connected' mean for a directed graph?
08What is the 'Handshaking Lemma'?
09A 'Self-loop' is an edge that:
10A bipartite graph is one that can be colored with how many colors?