Graphs Flashcards

(8 cards)

1
Q

Graph

A

collection of vertices (or nodes) (V) and edges (E)

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

Weighted Graph

A

edges have some weight or cost assigned to them

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

Directed/Undirected Graph

A

edges may point in one direction or not

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

Adjacency Matrix

A

V x V matrix in which entry A[i][j] = 1 if there exists a path from vertex i to vertex j—else it is 0

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

Adjacency List

A

collection of lists (A) where A[i] contains vertices which are neighbors of vertex i

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

Path

A

sequence of vertices in which each pair of successive vertices is connected by an edge

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

Cycle

A

path where the last node is connected the first node

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

Connected Graph

A

graphs with paths between every pair of vertices

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