Java to compare graph algorithms

Question

Is Java suitable for a project that will compare performances of Dijkstra and Bellman-Ford algorithms on given graphs? Or do I have to use C?

Answer 1

语言开销是相同的，因此您可以使用任何语言来比较两种算法。

Answer 2

You can use any of the two languages as long as you are consistent and use the same language to implement both algorithms.

For example, writing Dijkstra in C and comparing it to Bellman-Ford written in Java is inaccurate.

Answer 3

I think you should certainly be able to use Java for such a comparison. Although it might be harder to interpret your results. For example, it might not be the best idea to write code that uses objects and garbage collection excessively since you would find it hard to isolate these effects from the raw running time. The startup overhead will be similar, but within the algorithms, you could end up "using more Java" in one than in the other (probably in Dijkstra's algorithm with the tree) and hence slowing it down.

Answer 4

A good "test of the test" is to compare the two algorithms in several implementations in different languages. If the comparison is consistent across implementations, then that is good evidence that the results were not due to an accident of the language or execution environment.