SPACE.md

The content of this file was obtained with:

$ space run -d Html

Benchmarks

Doing:

---

• edgeList
• vertexList
• equality
• transpose
• dff
• topSort
• reachable
• vertexCount
• edgeCount
• hasEdge
• isEmpty
• hasVertex
• addEdge
• addVertex
• removeVertex
• removeEdge
• mergeContext
• creation

---

Using [("Mesh",3),("Clique",3)] as graphs

Note: results are in bytes

edgeList

Description: Produce a list of the edges in the graph

Mesh

	1	10	100
Alga	184	17,432	333,184
Containers	160	1,920	22,400
Fgl	32	4,024	53,992
Hash-Graph	16	2,232	30,376

Clique

	1	10	100
Alga	184	61,976	10,505,080
Containers	160	4,480	404,080
Fgl	32	13,200	1,428,000
Hash-Graph	16	7,144	775,168

SUMMARY:

• Containers used the least amount of memory 4 times
• Hash-Graph used the least amount of memory 2 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Containers was 18.92 times lighter than Alga
• Hash-Graph was 11.91 times lighter than Alga
• Fgl was 6.60 times lighter than Alga

vertexList

Description: Produce a list of the vertices in the graph

Mesh

	1	10	100
Alga	112	6,416	175,496
Containers	96	816	8,016
Fgl	152	1,800	18,360
Hash-Graph	24	736	8,240

Clique

	1	10	100
Alga	112	20,856	5,013,368
Containers	96	816	8,016
Fgl	152	1,800	18,360
Hash-Graph	24	736	8,240

SUMMARY:

• Hash-Graph used the least amount of memory 4 times

There was 2 ex-aequo

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Containers was 42.31 times lighter than Alga
• Hash-Graph was 41.16 times lighter than Alga
• Fgl was 18.47 times lighter than Alga

equality

Description: Test if two graphs are equals

Mesh

	1	10	100
Alga	724	26,736	501,908
Containers	140	332	2,684
Fgl	1,324	21,248	284,428
Hash-Graph	772	11,180	167,520

Clique

	1	10	100
Alga	724	94,960	15,969,676
Containers	140	716	59,936
Fgl	1,324	60,728	6,958,848
Hash-Graph	772	33,268	4,923,880

SUMMARY:

• Containers used the least amount of memory 10 times
• Hash-Graph used the least amount of memory 2 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Containers was 295.97 times lighter than Alga
• Hash-Graph was 16.41 times lighter than Alga
• Fgl was 2.84 times lighter than Alga

transpose

Description: Transpose (invert all the edges) the graph

Mesh

	1	10	100
Alga	0	1,800	25,704
Containers	392	4,336	50,112

Clique

	1	10	100
Alga	0	6,408	712,728
Containers	392	9,968	889,808

SUMMARY:

• Alga used the least amount of memory 6 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Alga was 1.52 times lighter than Containers

dff

Description: Produce a forest, obtainened from a DFS (Deep First Search) of each vertex

Mesh

	1	10	100
Containers	424	5,704	64,552
Fgl	784	12,960	175,752
Hash-Graph	272	5,856	114,592

Clique

	1	10	100
Containers	424	11,080	866,080
Fgl	784	17,784	1,231,296
Hash-Graph	272	8,752	482,480

SUMMARY:

• Hash-Graph used the least amount of memory 4 times
• Containers used the least amount of memory 1 times

There was 1 ex-aequo

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Hash-Graph was 2.20 times lighter than Fgl
• Containers was 1.87 times lighter than Fgl

topSort

Description: Topological sorting of the vertices

Mesh

	1	10	100
Containers	504	6,504	72,552
Fgl	1,184	18,504	307,824

Clique

	1	10	100
Containers	504	11,880	874,080
Fgl	1,184	28,120	1,845,616

SUMMARY:

• Containers used the least amount of memory 6 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Containers was 2.82 times lighter than Fgl

reachable

Description: Produce a list of reachable vertices from a given one

Mesh

	1	10	100
Containers	448	2,440	25,384
Fgl	1,000	8,732	104,444

Clique

	1	10	100
Containers	448	5,128	426,148
Fgl	1,000	13,256	665,276

SUMMARY:

• Containers used the least amount of memory 10 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Containers was 2.35 times lighter than Fgl

vertexCount

Description: Count the vertices of the graph

Mesh

	1	10	100
Alga	72	5,872	169,912
Containers	16	16	16
Fgl	16	16	16
Hash-Graph	32	32	32

Clique

	1	10	100
Alga	72	20,312	5,007,784
Containers	16	16	16
Fgl	16	16	16
Hash-Graph	32	32	32

SUMMARY:

There was 6 ex-aequo

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Fgl was 20542.02 times lighter than Alga
• Containers was 20542.02 times lighter than Alga
• Hash-Graph was 10271.01 times lighter than Alga

edgeCount

Description: Count the edges of the graph

Mesh

	1	10	100
Alga	200	17,448	333,200
Containers	40	40	40
Fgl	48	2,584	33,960
Hash-Graph	64	1,856	20,592

Clique

	1	10	100
Alga	200	61,992	10,505,096
Containers	40	40	40
Fgl	48	8,176	873,616
Hash-Graph	64	1,856	20,592

SUMMARY:

• Containers used the least amount of memory 6 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Containers was 16147.82 times lighter than Alga
• Hash-Graph was 31.37 times lighter than Alga
• Fgl was 9.88 times lighter than Alga

hasEdge

Description: Test if the given edge is in the graph (with arguments both in the graph and not in the graph (where applicable))

Mesh

	1	10	100
Alga	1,592	3,359	3,596
Containers	0	0	0
Fgl	488	1,559	1,836
Hash-Graph	208	252	252

Clique

	1	10	100
Alga	1,592	6,212	140,495
Containers	0	0	0
Fgl	488	4,135	46,728
Hash-Graph	208	252	252

SUMMARY:

• Containers used the least amount of memory 26 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Containers was Infinity times lighter than Alga
• Hash-Graph was 25.86 times lighter than Alga
• Fgl was 1.89 times lighter than Alga

isEmpty

Description: Test if the graph is empty

Mesh

	1	10	100
Alga	0	0	0
Fgl	0	0	0
Hash-Graph	0	0	0

Clique

	1	10	100
Alga	0	0	0
Fgl	0	0	0
Hash-Graph	0	0	0

SUMMARY:

There was 6 ex-aequo

hasVertex

Description: Test if the given vertex is in the graph

Mesh

	1	10	100
Alga	24	24	24
Fgl	220	804	1,136
Hash-Graph	8	12	12

Clique

	1	10	100
Alga	24	24	24
Fgl	220	1,884	25,654
Hash-Graph	8	12	12

SUMMARY:

• Hash-Graph used the least amount of memory 14 times

There was 6 ex-aequo

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Hash-Graph was 2.00 times lighter than Alga

addEdge

Description: Add an edge (not already in the graph)

Mesh

	1	10	100
Alga	80	80	80
Fgl	480	920	1,150
Hash-Graph	448	1,308	5,938

Clique

	1	10	100
Alga	80	80	80
Fgl	480	940	1,300
Hash-Graph	448	1,308	6,092

SUMMARY:

• Alga used the least amount of memory 18 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Alga was 75.17 times lighter than Hash-Graph
• Fgl was 4.93 times lighter than Hash-Graph

addVertex

Description: Add a vertex (not already in the graph)

Mesh

	1	10	100
Alga	40	40	40
Fgl	120	140	200
Hash-Graph	248	768	5,184

Clique

	1	10	100
Alga	40	40	40
Fgl	120	140	200
Hash-Graph	248	768	5,184

SUMMARY:

• Alga used the least amount of memory 12 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Alga was 129.60 times lighter than Hash-Graph
• Fgl was 25.92 times lighter than Hash-Graph

removeVertex

Description: Remove a vertex of the graph

Mesh

	1	10	100
Alga	32	572	8,528
Fgl	220	1,020	1,524
Hash-Graph	96	2,092	7,324

Clique

	1	10	100
Alga	32	1,952	333,536
Fgl	220	2,252	29,652
Hash-Graph	96	6,568	99,644

SUMMARY:

• Fgl used the least amount of memory 6 times
• Alga used the least amount of memory 5 times

There was 1 ex-aequo

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Fgl was 7.47 times lighter than Alga
• Hash-Graph was 1.87 times lighter than Alga

removeEdge

Description: Remove an edge of the graph

Mesh

	10	100
Alga	10,691	139,576
Fgl	2,523	3,397
Hash-Graph	1,008	5,627

Clique

	10	100
Alga	36,840	3,960,144
Fgl	7,789	104,045
Hash-Graph	1,157	5,957

SUMMARY:

• Hash-Graph used the least amount of memory 9 times
• Fgl used the least amount of memory 3 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Hash-Graph was 356.85 times lighter than Alga
• Fgl was 39.52 times lighter than Alga

mergeContext

Description: Merge a FGL context in the graph

Mesh

	1	10	100
Fgl	312	616	968
Hash-Graph	325	843	5,261

Clique

	1	10	100
Fgl	312	659	1,080
Hash-Graph	325	843	5,261

SUMMARY:

• Fgl used the least amount of memory 12 times
• Hash-Graph used the least amount of memory 2 times

There was 4 ex-aequo

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Fgl was 5.14 times lighter than Hash-Graph

creation

Description: Create a graph from a list of edges

Mesh

	1	10	100
Alga	0	5,360	67,544
Containers	232	3,768	39,456
Fgl	16	19,448	303,560
Hash-Graph	16	16,992	273,192

Clique

	1	10	100
Alga	0	16,496	1,751,696
Containers	232	7,992	693,072
Fgl	16	60,640	8,294,120
Hash-Graph	16	53,488	8,445,400

SUMMARY:

• Containers used the least amount of memory 4 times
• Alga used the least amount of memory 2 times

ABSTRACT: (Based on an average of the ratio between largest benchmarks)

• Containers was 9.37 times lighter than Fgl
• Alga was 4.59 times lighter than Fgl
• Hash-Graph was 1.06 times lighter than Fgl