Skip to main content

Node ↔ each data point on Graph

aka Nodes

References​

  1. Edge ↔ connection between Nodes

  2. Undirected Edge ↔ Edge flow both ways between Nodes

  3. Directed Edge ↔ Edge flow in one direction between Nodes

  4. Weighted Edge ↔ Edge with extra (numeric) data about Node connection

  5. Cyclial Edge ↔ Edge point back to same Node

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

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

  8. Graph ↔ Non-linear data structure of Nodes & Edges