comparison - RavidSaadia/directional-weighted-graph-PY GitHub Wiki

in this page we represents the comparison we made between several graphs (small to large). the metrics showed are in seconds. the java runtimes are taken from our last java assignment, the python runtimes are from the current project, and the last columns are the same graphs converted to networkX DS and calculated by their own algorithms. all the tests were made with the same parameters including the generated keys for shortest path calculations.

java python networkX

V- E - seed\function sccs scc sp sccs scc sp sccs scc sp

G_10_80_1 0.004 0.001 0.009 0.0009 0 0 0 - 0

G_100_800_1 0.008 0.006 0.001 0.001 0.0009 0 0 - 0.001

G_1000_8000_1 0.076 0.058 0.026 0.0160 0.0177 0 0 - 0.001

G_10000_80000_1 0.248 0.144 0.054 0.2636 0.3112 0.0474 0 - 0.108

G_20000_160000_1 0.387 0.379 0.129 0.8145 0.7708 0.1152 0 - 0.1616

G_30000_240000_1 0.782 0.685 0.261 1.8027 1.4144 0.1420 0 - 0.3341

	java			python			networkX
V- E - seed\function	sccs	scc	sp	sccs	scc	sp	sccs	scc	sp
G_10_80_1	0.004	0.001	0.009	0.0009	0	0	0	-	0
G_100_800_1	0.008	0.006	0.001	0.001	0.0009	0	0	-	0.001
G_1000_8000_1	0.076	0.058	0.026	0.0160	0.0177	0	0	-	0.001
G_10000_80000_1	0.248	0.144	0.054	0.2636	0.3112	0.0474	0	-	0.108
G_20000_160000_1	0.387	0.379	0.129	0.8145	0.7708	0.1152	0	-	0.1616
G_30000_240000_1	0.782	0.685	0.261	1.8027	1.4144	0.1420	0	-	0.3341

The computer details:

intel(R) core(TM) i7-8565U CPU @ 1.80 GHz 1.99 GHz 8 GB RAM
windows 64 bit