2 questions on undirected graph
Can anyone please help me solve these two question on an undirected graph(data structure)? Thanks a lot!
Given a weighted, undirected graph with |V| nodes, answer the following as best as possible, with a brief explanation. Assume all weights are non-negative.
a. If each edge has weight ≤ w, what can you say about the cost of an MST?
b. If the cost of an MST is c, what can you say about the shortest distances returned by Dijkstra’s algorithm when run with an arbitrary vertex s as the source?
Given a weighted, undirected graph with |V| nodes, answer the following as best as possible, with a brief explanation. Assume all weights are non-negative.
a. If each edge has weight ≤ w, what can you say about the cost of an MST?
b. If the cost of an MST is c, what can you say about the shortest distances returned by Dijkstra’s algorithm when run with an arbitrary vertex s as the source?
Topic archived. No new replies allowed.