Graph Processing Flashcards

1
Q

What are some graph representation methods?

A
  • Adjacency matrix: nxn matrix where nonzero element indicates an edge from Vi to Vj
  • Adjacency list: A list of tuples from vertex to a list of other vertex connections
  • Edge list: A list of vertex tuples that represents edges
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a spanning tree?

A

A subgraph that contains all nodes and the minimum number of edges.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly