Neural Sync Active
Chatty reference · computationalthinking week 8
Registry Synced
Chatty reference · computationalthinking week 8
75 words
1 min read
2026-08-16
16. CT Week 8 — Adjacency Matrix & Edge-Labelled Graphs
This is where representation becomes important.
Adjacency matrix
For a graph with n vertices:
A∈Rn×n
or, for a simple unweighted graph, commonly:
Aij∈{0,1}
depending on whether an edge exists.
Edge-labelled graph
Edges carry additional information:
ulabelv
The label could represent:
- weight
- distance
- cost
- type
- relationship
The important CT skill:
Same underlying problem, different representation.