Graphs

Question 1

Graph Input Formats

What is an array of edges? Anything to note about it

Answer 1

An array of edges needs to be traversed over to create a lookup table for node neighbors.

The input type will be a 2D array in the format [x, y].

Question 2

Graph Input Format

What is an adjacency list, anything important to note?

Answer 2

Just a 2D array of integer references neighbor nodes, the lookup table is already here for you!

Question 3

Graph Input Type

What is the matrix input type, anything important to note?

Answer 3

These are unique to others because there is no set routine, nodes are not necessaily labeled from first to last.

This type is about problem comprehension.

Question 4

Graph Input Types

What is an adjacency matrix, anything important to note?

Answer 4

Similar to an adjacency matrix, but the matrix is NxN. This means matrix[i][j] = 1 refers to an edge from i -> j.

One can also elect to traverse the graph at first and turn things into a hashmap, may help when N is large.