1. Given an undirected graph G having N (1<N<=1000) vertices and positive weights. Find the shortest path from vertex 1 to vertex N, or state that such path doesn't exist.
2. You are given an unweighted, undirected graph. Write a program to check if it's a tree topology
(I have faced this question in Amazon online test).
2. You are given an unweighted, undirected graph. Write a program to check if it's a tree topology
(I have faced this question in Amazon online test).
No comments:
Post a Comment