You can construct an adjacency list from an adjacency matrix in O(|E|) time, where |E| is the number of edges in the graph. You can construct an adjacency matrix from an adjacency list in O(|E|) time,...

need help with this computer scinece problem

Extracted text: You can construct an adjacency list from an adjacency matrix in O(|E|) time, where |E| is the number of edges in the graph. You can construct an adjacency matrix from an adjacency list in O(|E|) time, where |E| is the number of edges in the graph. A map can be used to relate vertex names/values to index numbers (or vise versa). Shortest path algorithms start at a single vertex (the "source") and find the shortest path to a single destination (the "sink").