kipriyanovichFuture engineers!
An **Adjacency Matrix** (A) shows graph connections: A[i][j]=1 if vertex i links to j, else 0.
Ex: For a-b, b-c: A[a,b]=1, A[b,a]=1.
Pro-Tip: It's symmetric for undirected graphs!
#GraphTheory #DiscreteMath #STEM #StudyNotes
An **Adjacency Matrix** (A) shows graph connections: A[i][j]=1 if vertex i links to j, else 0.
Ex: For a-b, b-c: A[a,b]=1, A[b,a]=1.
Pro-Tip: It's symmetric for undirected graphs!
#GraphTheory #DiscreteMath #STEM #StudyNotes