Comparison between minimal edges scenarios - best and worst
	Scenarios - minimal (best): graph with edges between the first node and the rest. - minimal inv (worst): graph with edges between the last node and the rest.
Machine	model	n	scenario	time	membranes	steps	memb/time	time/memb
Laptop	kernel 1	4	minimal	24	54	10	2,25	0,44
Laptop	kernel 1	4	minimal inv	28	54	10	1,93	0,52
Laptop	kernel 1	6	minimal	131	234	14	1,79	0,56
Laptop	kernel 1	6	minimal inv	456	729	14	1,60	0,63
Laptop	kernel 1	8	minimal	813	954	18	1,17	0,85
Laptop	kernel 1	8	minimal inv	7784	6561	18	0,84	1,19
Laptop	kernel 1	10	minimal	6333	3834	22	0,61	1,65
Laptop	kernel 1	10	minimal inv	264470	59049	22	0,22	4,48
Server	kernel 1	12	minimal	55616	15354	26	0,28	3,62
Server	kernel 1	12	minimal inv	Inf
	Time (ms)	Scenarios			Membranes no.	Scenarios
	n	minimal	minimal inv		n	minimal	minimal inv
	4	24	28		4	54	54
	6	131	456		6	234	729
	8	813	7784		8	954	6561
	10	6333	264470		10	3834	59049
			n	memb/time	time/memb
			4	2,25	0,44
			6	1,79	0,56
			8	1,17	0,85
			10	0,61	1,65