Page 1 of 1
Question 1: Graph Representation, shortest path tree. For below directed graph, B 10 20 2 11 3 15 A) Draw the adjacency
Posted: Fri May 20, 2022 4:31 pm
by answerhappygod
- Question 1 Graph Representation Shortest Path Tree For Below Directed Graph B 10 20 2 11 3 15 A Draw The Adjacency 1 (20.53 KiB) Viewed 45 times
Question 1: Graph Representation, shortest path tree. For below directed graph, B 10 20 2 11 3 15 A) Draw the adjacency matrix representation. B) Draw the adjacency list representation. C) If a pointer requires four bytes, a vertex label requires two bytes, and an edge weight requires two bytes, which representation requires more space for this graph? Why?