comparisons - Roniharel100/Ex3 GitHub Wiki

We want to introduce 3 methods that represent the runtimes of 6 different graphs in Python, java, and networkX.

3 methods:

shorted path: check the shortest path from node id1 to node id2. return the distance of the path, a list of the nodes ids that the path goes through.

Connect components: finds all the Strongly Connected Component(SCC) in the graph.

Connect component: finds the Strongly Connected Component(SCC) that node id1 is a part of.

6 graphs:

G_10_80_1 , G_100_800_1 , G_1000_8000_1, G_10000_80000_1, G_20000_160000_1, G_30000_240000_1.

computer Details:

Model: DELL p93G

Reg Tipe No: P93G001

Ram Memory: 16 GB

Processor: Intel(R) Core(TM) i7-8565U CPU @ 1.80GHz 1.99 GHz

Shorted path:

graph	java	python	Network x
G_10_80_1	0	0	0
G_100_800_1	0	0	0
G_1000_8000_1	0.016	0.015622615814208984	0
G_10000_80000_1	0.125	0.09374690055847168	0.06247138977050781
G_20000_160000_1	0.265	0.189479112625122077	0.18747282028198242
G_30000_240000_1	0.375	0.4138810634613037	0.24048638343811035

Connect components:

graph	java	python
G_10_80_1	0	0
G_100_800_1	0	0
G_1000_8000_1	0.078	0.03390932083129883
G_10000_80000_1	0.953	2.013040781021118
G_20000_160000_1	3.739	8.546873569488525
G_30000_240000_1	7.267	20.091862201690674

Connect component:

graph	java	python
G_10_80_1	0	0
G_100_800_1	0	0
G_1000_8000_1	0.062	0.015633583068847656
G_10000_80000_1	0.66	1.5594093799591064
G_20000_160000_1	1.812	6.350757360458374
G_30000_240000_1	4.28	13.959879636764526