Consider the following directed graph: We can trivially generalize steps in Dijkstra's and Prim's algorithms to a directed graph, by only considering neighbors of a newly added node that can be reache From a computer architecture point of view, why are ...