Skip to main content

Graph ↔ Non-linear data structure of Nodes & Edges

Edge​

connection between Nodes

Node​

each data point on Graph

Weighted Graph​

Graph with Weighted Edges

Traverse​

(process) to move across Graph & select Nodes

Adjacency Matrix​

2D Binary Matrix (as Array) to rep of Graph as # Nodes === # row/col & fill 1 for each Edge

Adjacency List​

List to rep Graph as collection of Node map to direct connections

numpy​

popular python lib to compute matrices & other scientific compute

References​

  1. Node ↔ each data point on Graph

  2. Traverse ↔ (process) to move across Graph & select Nodes

  3. BFS ↔ Search Algo to Traverse breadth first, down Graph child layer by child layer

  4. DFS ↔ Search Algo to Traverse depth first down Graph entire child subtree & backtrack

  5. Adjacency Matrix ↔ 2D Binary Matrix (as Array) to rep of Graph as # Nodes === # row/col & fill 1 for each Edge

  6. Adjacency List ↔ List to rep Graph as collection of Node map to direct connections

  7. Chart ↔ Graph to rep data