What is an adjacency matrix in a directed graph?... | Filo

Adjacency Matrix & List | Overview, Graphs & Examples

2. (5 points) Let G be a directed graph represented using an adjacency list. So, each node G[i] has a list of all nodes reachable in 1 step from i (all out-neighbors of i). Suppose each node of G also has a value: e.g., node 1 might have value 100, node 2 might have value50, etc. Give an O(|E| |V| log |V|) time algorithm that computes, for every node, the highest value reachable from that node (i.e., that you can get to by some path from that node). For instance, if it is possible to get to an