shashank.normative
BAN USER
Comments (3)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
You can use A* algo solve this problem.
A* uses the heuristics with cost function.
It applies the BFS and see the cost of every node and calculate the distance(i.e. heuristics function.)
complexity id O(n)
for BFS or DFS complexity is O(m+n)
Comment hidden because of low score. Click to expand.
0
of 0 vote
You can use A* algo solve this problem.
A* uses the heuristics with cost function.
It applies the BFS and see the cost of every node and calculate the distance(i.e. heuristics function.)
complexity id O(n)
for BFS or DFS complexity is O(m+n)
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Hash<FileId,Hash<customerid,acesstime>>
- shashank.normative April 16, 2012