Search:

I could have done it better than that

oh come on please some one answer this question.

what is the greedy choice property of Huffman code ?

why is it that people use BFS rather than using Dijkstra's when the edge weight is 1 to find the shortest path?

Okay now say i have a world map containing x number of cities and i want to find the shortest path between cities A and B in country A. Now if i were to run the algorithm all the time the user...

So can you use Dijkstra's algorithm to find shortest path between two cities in a world map?

Which algorithm BFS / DFS is most suitable to find the solution to a maze?

Any ideas?

Say in a map i need to find the shortest path between two cities A and B. If i run a single source shortest path algorithm to solve it , it will find the shortest path from vertex A to the all the...

How do i calculate the loop invariant of




while (A > 1) {
A = A / 32;
}
{A = 1}