08-12-2010, 03:39 AM
I was given the question
1.apply Prim's algorithm on the given graph 5 marks
2. for the given network which will be most suitable in your thinking to search shortest distance between nodes.
3. what is equilance relations,
4. give the running time and space requirements of Floyd Warshall algorithm
1.apply Prim's algorithm on the given graph 5 marks
2. for the given network which will be most suitable in your thinking to search shortest distance between nodes.
3. what is equilance relations,
4. give the running time and space requirements of Floyd Warshall algorithm