๐ธ 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) | binary-Nary ๐ณ Tree (programming) |
| 2-N incoming links | inverted binary-Nary ๐ณ Tree (programming) | general Graph |
More criteria
- Link Direction: uni/bidirectional
- Link Completeness: complete/incomplete
- Symmetry: balanced/unbalanced