🕸 Graph (programming)
= a logical connection of hetero-/homogeneous data structures, starting at an AnchNode → independent of implementation
Consist of
- Nodes: 🗂 Data structure and links
- Edges: connection between two nodes (→ ⛓ Adjacency matrix)
Classification
Number of links
- exactly 1 entry & exit node → 🧾 List (programming)
- exactly 1 entry and max. N exit nodes → 🌳 Tree (programming)
| 1 outgoing link | 2-N outgoing links | |
|---|---|---|
| 1 incoming link | linear [[List (programming) | 🧾 List (programming)]] |
| 2-N incoming links | inverted binary-Nary [[Tree (programming) | 🌳 Tree (programming)]] |
More criteria
- Link Direction: uni/bidirectional
- Link Completeness: complete/incomplete
- Symmetry: balanced/unbalanced