Skip to main content

Edge ↔ connection between Nodes

aka Edges

Undirected Edge​

Edge flow both ways between Nodes

Directed Edge​

Edge flow in one direction between Nodes

Weighted Edge​

Edge with extra (numeric) data about Node connection

Cyclial Edge​

Edge point back to same Node

References​

  1. Undirected Edge ↔ Edge flow both ways between Nodes

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

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

  4. Cyclial Edge ↔ Edge point back to same Node

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

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