Directed + Weighted Graphs:
P vs NP
Always has t==NULL as a base case & end condition as a bass case
if return node, t->left, t->right, l->head...
median-of-three quicksort: O(n logn) on average.
Directed + Weighted Graphs // P v NP
Directed & Weighted Graphs Lecture Slides Annotated
Annotated lecture slides for more info + added some of my own understanding
Adjacency Matrix
How is the adjacency matrix for a directed graph different to that for an undirected graph?
The adjacency matrix for an undirected graph is symmetric and has zeroes on the leading diagonal (no self-edges). The adjacency matrix for a directed graph is typically not symmetric and can have non-zero values on the leading diagonal (self-edges are allowed).