the edge with

minimum weight.

Which of the following statements is false?

to find the minimum weight spanning tree. If we add 1 to all the

edge weights, does the minimum weight spanning tree always

remain the same?

adjacency list representation for an undirected graph with n vertices

and m edges?

the shortest path between two nodes. If we add 1 to all the edge

weights, does the shortest path always remain the same?

algorithm will find the shortest path between two nodes more

efficiently?

LZW algorithm?

is the complexity of building a Huffman tree if there are