High level conclusions

Fuzzers reach 45.36% of cyclomatic complexity.

Fuzzers reach 38.64% of all functions.

Fuzzer linear_algos_directed is blocked:

The runtime code coverage of linear_algos_directed covers 27.45% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer read_graphml is blocked:

The runtime code coverage of read_graphml covers 17.59% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer write_all_graphml is blocked:

The runtime code coverage of write_all_graphml covers 29.72% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer spatial is blocked:

The runtime code coverage of spatial covers 19.67% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer write_all_gml is blocked:

The runtime code coverage of write_all_gml covers 29.72% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer misc_algos_weighted is blocked:

The runtime code coverage of misc_algos_weighted covers 29.20% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Reachability and coverage overview

Functions statically reachable by fuzzers

2923 / 7563

Cyclomatic complexity statically reachable by fuzzers

34331 / 75680

Runtime code coverage of functions

1532 / 7563

The following table shows data about each function in the project. The functions included in this table correspond to all functions that exist in the executables of the fuzzers. As such, there may be functions that are from third-party libraries.

For further technical details on the meaning of columns in the below table, please see the Glossary .

Func name	Functions filename	Args	Function call depth	Reached by Fuzzers	Runtime reached by Fuzzers	Combined reached by Fuzzers	Fuzzers runtime hit	Func lines hit %	I Count	BB Count	Cyclomatic complexity	Functions reached	Reached by functions	Accumulated cyclomatic complexity	Undiscovered complexity

Fuzzer: read_dimacs_flow

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	42	12.7%
gold	[1:9]	3	0.91%
yellow	[10:29]	5	1.51%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	279	84.8%
All colors	329	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
13	10	igraph_strvector_init	call site: 00010	igraph_error_handler_abort
4	35	igraph_read_graph_dimacs_flow	call site: 00035	igraph_fatalf
3	213	igraph_add_vertices	call site: 00213	igraph_error
3	219	igraph_i_property_cache_invalidate_conditionally	call site: 00219	igraph_i_property_cache_get_bool
2	207	igraph_add_vertices	call site: 00207	igraph_fatal
2	210	igraph_add_vertices	call site: 00210	igraph_vector_int_resize
2	224	igraph_empty_attrs	call site: 00224	igraph_fatalf
2	255	igraph_add_edges	call site: 00255	igraph_vector_int_push_back
1	27	igraph_vector_int_init	call site: 00027	igraph_error
1	85	strvector_expand_if_full	call site: 00085	igraph_error
1	120	igraph_vector_int_size	call site: 00120	igraph_error
1	144	igraph_create	call site: 00144	igraph_error

Runtime coverage analysis

Covered functions

71

Functions that are reachable but not covered

24

Reachable functions

83

Percentage of reachable functions covered

71.08%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_dimacs_flow.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/graph/attributes.c	5
/src/igraph/src/core/strvector.c	8
/src/igraph/src/core/vector.pmt	19
/src/igraph/src/io/dimacs.c	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1

Fuzzer: read_graphdb

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	55	21.3%
gold	[1:9]	3	1.16%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	4	1.55%
lawngreen	50+	196	75.9%
All colors	258	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
14	13	handle_input_error	call site: 00013	igraph_error
10	140	igraph_add_vertices	call site: 00140	igraph_vector_int_resize
4	34	igraph_read_graph_graphdb	call site: 00034	igraph_fatalf
4	233	igraph_add_edges	call site: 00233	igraph_vector_int_resize
3	127	igraph_add_vertices	call site: 00127	igraph_errorf
3	153	igraph_i_property_cache_invalidate_conditionally	call site: 00153	igraph_i_property_cache_get_bool
2	118	igraph_empty_attrs	call site: 00118	igraph_error
2	157	igraph_empty_attrs	call site: 00157	igraph_fatalf
2	190	igraph_add_edges	call site: 00190	igraph_vector_int_push_back
1	31	igraph_vector_int_init	call site: 00031	igraph_error
1	55	igraph_vector_int_size	call site: 00055	igraph_error
1	73	igraph_create	call site: 00073	igraph_error

Runtime coverage analysis

Covered functions

42

Functions that are reachable but not covered

24

Reachable functions

66

Percentage of reachable functions covered

63.64%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_graphdb.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/io/graphdb.c	3
/src/igraph/src/core/vector.pmt	12
/src/igraph/src/core/interruption.c	1
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	4
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1

Fuzzer: read_ncol

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	302	33.3%
gold	[1:9]	1	0.11%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	603	66.5%
All colors	906	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
156	648	igraph_eit_create	call site: 00648	igraph_i_eit_all_between
11	315	igraph_vector_reserve	call site: 00315	igraph_trie_get_len
9	16	igraph_vector_int_init	call site: 00016	igraph_error
9	400	igraph_attribute_record_set_type	call site: 00400	igraph_vector_bool_init
7	848	igraph_write_graph_ncol	call site: 00848	igraph_ess_all
5	10	igraph_vector_int_init	call site: 00010	igraph_fatal_handler_abort
5	333	igraph_trie_get_len	call site: 00333	igraph_i_parse_real
5	365	igraph_read_graph_ncol	call site: 00365	igraph_error
5	864	igraph_real_fprintf_precise	call site: 00864	igraph_error
4	27	igraph_read_graph_ncol	call site: 00027	igraph_fatalf
4	225	igraph_trie_get	call site: 00225	igraph_error
4	234	igraph_strvector_resize	call site: 00234	igraph_strvector_reserve

Runtime coverage analysis

Covered functions

164

Functions that are reachable but not covered

45

Reachable functions

186

Percentage of reachable functions covered

75.81%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_ncol.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	18
/src/igraph/src/io/ncol.c	4
/src/igraph/src/core/vector.pmt	23
/src/igraph/src/core/trie.c	11
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/core/memory.c	1
/src/igraph/build/src/io/parsers/ncol-lexer.c	22
/src/igraph/build/src/io/parsers/ncol-parser.c	5
/src/igraph/src/io/ncol-parser.y	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	10
/src/igraph/src/core/printing.c	1

Fuzzer: read_lgl

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	260	28.5%
gold	[1:9]	1	0.10%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	651	71.3%
All colors	912	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
100	692	igraph_eit_create	call site: 00692	igraph_i_eit_all_between
12	663	igraph_incident	call site: 00663	igraph_vector_int_append
10	172	igraph_vector_reserve	call site: 00172	igraph_trie_get_len
9	16	igraph_vector_init	call site: 00016	igraph_error
9	394	igraph_attribute_record_set_type	call site: 00394	igraph_vector_bool_init
5	10	igraph_vector_init	call site: 00010	igraph_fatal_handler_abort
5	164	igraph_vector_int_push_back	call site: 00164	igraph_vector_int_push_back
5	650	igraph_i_eit_create_allfromto	call site: 00650	igraph_incident
5	837	igraph_write_graph_lgl	call site: 00837	igraph_ess_all
5	851	igraph_real_fprintf_precise	call site: 00851	igraph_error
4	27	igraph_read_graph_lgl	call site: 00027	igraph_fatalf
4	312	igraph_trie_get	call site: 00312	igraph_error

Runtime coverage analysis

Covered functions

169

Functions that are reachable but not covered

42

Reachable functions

186

Percentage of reachable functions covered

77.42%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_lgl.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	18
/src/igraph/src/io/lgl.c	4
/src/igraph/src/core/vector.pmt	21
/src/igraph/src/core/trie.c	11
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/build/src/io/parsers/lgl-lexer.c	22
/src/igraph/build/src/io/parsers/lgl-parser.c	5
/src/igraph/src/io/lgl-parser.y	1
/src/igraph/src/core/memory.c	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	11
/src/igraph/src/core/printing.c	1

Fuzzer: read_dl

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	176	24.3%
gold	[1:9]	1	0.13%
yellow	[10:29]	1	0.13%
greenyellow	[30:49]	3	0.41%
lawngreen	50+	543	75.0%
All colors	724	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
18	197	igraph_vector_int_push_back	call site: 00197	igraph_i_dl_add_edge_w
17	412	igraph_trie_get_len	call site: 00412	igraph_i_parse_integer
12	230	igraph_vector_push_back	call site: 00230	igraph_i_dl_add_edge
9	16	igraph_vector_int_init	call site: 00016	igraph_error
9	249	igraph_i_parse_integer	call site: 00249	igraph_i_dl_add_edge_w
9	494	igraph_attribute_record_set_type	call site: 00494	igraph_vector_bool_init
8	220	igraph_vector_resize	call site: 00220	igraph_i_dl_add_edge
5	10	igraph_vector_int_init	call site: 00010	igraph_fatal_handler_abort
5	156	igraph_errorf	call site: 00156	igraph_i_dl_add_str
5	178	igraph_strvector_push_back_len	call site: 00178	igraph_vector_int_push_back
5	265	igraph_i_parse_real	call site: 00265	igraph_errorf
4	27	igraph_read_graph_dl	call site: 00027	igraph_fatalf

Runtime coverage analysis

Covered functions

151

Functions that are reachable but not covered

33

Reachable functions

167

Percentage of reachable functions covered

80.24%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_dl.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/graph/attributes.c	14
/src/igraph/src/io/dl.c	2
/src/igraph/src/core/vector.pmt	21
/src/igraph/src/core/strvector.c	15
/src/igraph/src/core/trie.c	11
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/build/src/io/parsers/dl-lexer.c	22
/src/igraph/build/src/io/parsers/dl-parser.c	5
/src/igraph/src/io/dl-parser.y	5
/src/igraph/src/io/parse_utils.c	2
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1

Fuzzer: read_gml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	224	16.7%
gold	[1:9]	22	1.64%
yellow	[10:29]	3	0.22%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1086	81.3%
All colors	1335	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
13	10	igraph_read_graph_gml	call site: 00010	igraph_error_handler_abort
13	290	igraph_gml_tree_init_tree	call site: 00290	igraph_i_parse_real
11	235	igraph_gml_tree_init_real	call site: 00235	igraph_i_gml_make_string
10	263	igraph_gml_tree_init_string	call site: 00263	igraph_i_gml_make_list
9	186	igraph_gml_tree_mergedest	call site: 00186	igraph_i_gml_make_numeric
9	394	igraph_strvector_destroy	call site: 00394	igraph_vector_bool_init
8	136	igraph_gml_tree_init_empty	call site: 00136	igraph_i_gml_merge
8	1044	entity_encode	call site: 01044	igraph_error
8	1250	igraph_write_graph_gml	call site: 01250	igraph_error
8	1303	igraph_write_graph_gml	call site: 01303	igraph_error
7	107	igraph_gml_yylex	call site: 00107	igraph_i_gml_make_empty
7	312	igraph_errorf	call site: 00312	igraph_i_gml_get_string

Runtime coverage analysis

Covered functions

229

Functions that are reachable but not covered

46

Reachable functions

239

Percentage of reachable functions covered

80.75%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_gml.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	25
/src/igraph/src/io/gml.c	15
/src/igraph/src/io/gml-tree.c	16
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/core/vector.pmt	32
/src/igraph/build/src/io/parsers/gml-lexer.c	22
/src/igraph/build/src/io/parsers/gml-parser.c	5
/src/igraph/src/io/gml-parser.y	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	12
/src/igraph/src/core/strvector.c	12
/src/igraph/src/core/trie.c	10
/src/igraph/src/core/printing.c	2
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	3
/src/igraph/src/internal/qsort.c	4

Fuzzer: read_edgelist

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	177	39.0%
gold	[1:9]	2	0.44%
yellow	[10:29]	5	1.10%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	269	59.3%
All colors	453	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
100	334	igraph_eit_create	call site: 00334	igraph_i_eit_all_between
12	305	igraph_incident	call site: 00305	igraph_vector_int_append
10	156	igraph_add_vertices	call site: 00156	igraph_vector_int_resize
9	15	igraph_vector_int_init	call site: 00015	igraph_error
5	9	igraph_vector_int_init	call site: 00009	igraph_fatal_handler_abort
5	292	igraph_i_eit_create_allfromto	call site: 00292	igraph_incident
4	26	igraph_read_graph_edgelist	call site: 00026	igraph_fatalf
4	251	igraph_add_edges	call site: 00251	igraph_vector_int_resize
3	62	igraph_i_fget_integer	call site: 00062	igraph_error
3	169	igraph_i_property_cache_invalidate_conditionally	call site: 00169	igraph_i_property_cache_get_bool
2	136	igraph_empty_attrs	call site: 00136	igraph_error
2	174	igraph_empty_attrs	call site: 00174	igraph_fatalf

Runtime coverage analysis

Covered functions

52

Functions that are reachable but not covered

37

Reachable functions

89

Percentage of reachable functions covered

58.43%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_edgelist.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/io/edgelist.c	2
/src/igraph/src/core/vector.pmt	13
/src/igraph/src/core/interruption.c	1
/src/igraph/src/io/parse_utils.c	3
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	4
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	9

Fuzzer: edge_connectivity

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	651	46.9%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	735	53.0%
All colors	1386	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
142	1056	igraph_maxflow	call site: 01056	igraph_is_dag
138	762	igraph_eit_create	call site: 00762	igraph_i_eit_all_between
53	340	igraph_vit_create	call site: 00340	igraph_neighbors
46	1334	igraph_to_undirected	call site: 01334	igraph_create
39	1293	igraph_to_undirected	call site: 01293	igraph_fixed_vectorlist_convert
29	551	igraph_i_connected_components_weak	call site: 00551	igraph_i_connected_components_strong
24	1229	igraph_to_undirected	call site: 01229	igraph_eit_create
21	715	igraph_i_mincut_undirected	call site: 00715	igraph_vector_int_append
14	742	igraph_maxflow	call site: 00742	igraph_i_maxflow_undirected
10	103	igraph_add_vertices	call site: 00103	igraph_vector_int_resize
9	10	igraph_vector_int_init	call site: 00010	igraph_error
9	910	igraph_edges	call site: 00910	igraph_maxflow

Runtime coverage analysis

Covered functions

126

Functions that are reachable but not covered

46

Reachable functions

172

Percentage of reachable functions covered

73.26%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/edge_connectivity.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	29
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	3
/src/igraph/src/graph/type_indexededgelist.c	13
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/graph/attributes.c	7
/src/igraph/src/core/vector.c	2
/src/igraph/src/flow/flow.c	13
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	2
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	5
/src/igraph/src/graph/iterators.c	14
/src/igraph/src/core/progress.c	1
/src/igraph/src/core/cutheap.c	11
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/core/buckets.c	14
/src/igraph/src/properties/dag.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8

Fuzzer: bliss

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	187	29.2%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	453	70.7%
All colors	640	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
25	422	bliss::BigNum::multiply(int)	call site: 00422	mpz_mul_ui
17	582	(anonymous namespace)::bliss_info_to_igraph(igraph_bliss_info_t*, bliss::Stats const&)	call site: 00582	mpn_div_qr_1_invert
15	602	(anonymous namespace)::bliss_info_to_igraph(igraph_bliss_info_t*, bliss::Stats const&)	call site: 00602	mpz_sizeinbase
13	523	bliss::AbstractGraph::search(bool, bliss::Stats&, std::__1::function const&, std::__1::function const&)	call site: 00523	__assert_fail
10	103	igraph_add_vertices	call site: 00103	igraph_vector_int_resize
10	541	bliss::AbstractGraph::search(bool, bliss::Stats&, std::__1::function const&, std::__1::function const&)	call site: 00541	__assert_fail
9	10	igraph_vector_int_init	call site: 00010	igraph_error
6	316	bliss::BigNum::assign(int)	call site: 00316	mpz_set_ui
6	556	bliss::Orbit::merge_orbits(unsigned int, unsigned int)	call site: 00556	__assert_fail
5	4	igraph_vector_int_init	call site: 00004	igraph_fatal_handler_abort
5	271	(anonymous namespace)::bliss_from_igraph(igraph_t const*)	call site: 00271	__cxa_allocate_exception
4	40	igraph_empty_attrs	call site: 00040	igraph_fatalf

Runtime coverage analysis

Covered functions

231

Functions that are reachable but not covered

72

Reachable functions

315

Percentage of reachable functions covered

77.14%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/bliss.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	11
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	9
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/properties/multiplicity.c	1
/src/igraph/src/core/typed_list.pmt	7
/src/igraph/src/isomorphism/bliss.cc	7
/src/igraph/src/isomorphism/bliss/graph.cc	23
/src/igraph/src/isomorphism/bliss/partition.cc	16
/src/igraph/src/isomorphism/bliss/kstack.hh	6
/src/igraph/src/isomorphism/bliss/kqueue.hh	7
/src/igraph/src/isomorphism/bliss/heap.cc	3
/src/igraph/src/isomorphism/bliss/uintseqhash.hh	5
/src/igraph/src/isomorphism/bliss/orbit.cc	9
/src/igraph/src/isomorphism/bliss/graph.hh	3
/src/igraph/src/isomorphism/bliss/stats.hh	10
/src/igraph/src/isomorphism/bliss/bignum.hh	5
/src/igraph/vendor/mini-gmp/mini-gmp.c	32
/src/igraph/src/isomorphism/bliss/partition.hh	8
/src/igraph/src/isomorphism/bliss/uintseqhash.cc	1
/src/igraph/src/isomorphism/bliss/orbit.hh	1

Fuzzer: centrality

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	2468	65.4%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1303	34.5%
All colors	3771	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
1283	1781	igraph_i_rng_get_random_bits_uint64	call site: 01781	igraph_arpack_rnsolve
129	1517	igraph_i_trans4_al_simplify	call site: 01517	transitivity_local_undirected2
64	3117	prpack::prpack_solver::solve_via_ge(double, double, int, double const*, double const*)	call site: 03117	log
63	3537	igraph_simplify	call site: 03537	igraph_delete_edges
62	1078	igraph_closeness_cutoff	call site: 01078	igraph_i_closeness_cutoff_weighted
52	801	igraph_get_eid	call site: 00801	igraph_i_eit_all_between
51	453	igraph_betweenness_cutoff	call site: 00453	sspf_weighted
44	754	igraph_eit_create	call site: 00754	igraph_i_eit_create_incident
44	1191	LLVMFuzzerTestOneInput	call site: 01191	igraph_i_harmonic_centrality_weighted
44	3486	igraph_to_undirected	call site: 03486	igraph_create
40	1284	LLVMFuzzerTestOneInput	call site: 01284	igraph_i_average_path_length_dijkstra
38	1692	igraph_vector_fill	call site: 01692	igraph_strength

Runtime coverage analysis

Covered functions

177

Functions that are reachable but not covered

305

Reachable functions

516

Percentage of reachable functions covered

40.89%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/centrality.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/core/vector.pmt	49
/src/igraph/src/random/random.c	6
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	15
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/graph/attributes.c	8
/src/igraph/src/core/vector.c	2
/src/igraph/src/graph/iterators.c	18
/src/igraph/src/centrality/betweenness.c	9
/src/igraph/src/graph/adjlist.c	17
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/stack.pmt	8
/src/igraph/src/core/progress.c	1
/src/igraph/src/core/indheap.c	16
/src/igraph/src/math/utils.c	1
/src/igraph/src/core/dqueue.pmt	6
/src/igraph/src/centrality/closeness.c	5
/src/igraph/src/paths/shortest_paths.c	6
/src/igraph/src/properties/triangles.c	12
/src/igraph/src/centrality/pagerank.c	5
/src/igraph/src/linalg/arpack.c	10
/src/igraph/src/core/matrix.pmt	5
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/math/complex.c	6
/src/igraph/vendor/lapack/dnaupd.c	1
/src/igraph/vendor/lapack/arscnd.c	1
/src/igraph/vendor/f2c/s_cmp.c	1
/src/igraph/vendor/lapack/dlamch.c	1
/src/igraph/vendor/lapack/fortran_intrinsics.c	7
/src/igraph/vendor/lapack/lsame.c	1
/src/igraph/vendor/lapack/dnaup2.c	1
/src/igraph/vendor/f2c/pow_dd.c	1
/src/igraph/vendor/lapack/dgetv0.c	1
/src/igraph/vendor/lapack/dlarnv.c	1
/src/igraph/vendor/lapack/dlaruv.c	1
/src/igraph/vendor/lapack/dcopy.c	1
/src/igraph/vendor/lapack/ddot.c	1
/src/igraph/vendor/lapack/dnrm2.c	1
/src/igraph/vendor/lapack/dgemv.c	1
/src/igraph/vendor/lapack/xerbla.c	1
/src/igraph/vendor/f2c/wsfe.c	1
/src/igraph/vendor/f2c/err.c	5
/src/igraph/vendor/f2c/sfe.c	2
/src/igraph/vendor/f2c/sig_die.c	1
/src/igraph/vendor/f2c/close.c	2
/src/igraph/vendor/f2c/endfile.c	1
/src/igraph/vendor/f2c/open.c	4
/src/igraph/vendor/f2c/util.c	2
/src/igraph/vendor/f2c/fmt.c	13
/src/igraph/vendor/lapack/len_trim.c	1
/src/igraph/vendor/f2c/i_len.c	1
/src/igraph/vendor/f2c/s_stop.c	1
/src/igraph/vendor/lapack/dvout.c	1
/src/igraph/vendor/lapack/dnaitr.c	1
/src/igraph/vendor/lapack/dlabad.c	1
/src/igraph/vendor/f2c/d_lg10.c	1
/src/igraph/vendor/lapack/ivout.c	1
/src/igraph/vendor/lapack/dscal.c	1
/src/igraph/vendor/lapack/dlascl.c	1
/src/igraph/vendor/lapack/disnan.c	1
/src/igraph/vendor/lapack/dlaisnan.c	1
/src/igraph/vendor/lapack/daxpy.c	1
/src/igraph/vendor/lapack/dlanhs.c	1
/src/igraph/vendor/lapack/dlassq.c	1
/src/igraph/vendor/lapack/dmout.c	1
/src/igraph/vendor/lapack/dneigh.c	1
/src/igraph/vendor/lapack/dlacpy.c	1
/src/igraph/vendor/lapack/dlahqr.c	1
/src/igraph/vendor/lapack/dlarfg.c	1
/src/igraph/vendor/lapack/dlapy2.c	1
/src/igraph/vendor/f2c/d_sign.c	1
/src/igraph/vendor/lapack/dlanv2.c	1
/src/igraph/vendor/lapack/drot.c	1
/src/igraph/vendor/lapack/dtrevc.c	1
/src/igraph/vendor/lapack/dlaln2.c	1
/src/igraph/vendor/lapack/dladiv.c	3
/src/igraph/vendor/lapack/idamax.c	1
/src/igraph/vendor/lapack/dngets.c	1
/src/igraph/vendor/lapack/dsortc.c	1
/src/igraph/vendor/lapack/dnconv.c	1
/src/igraph/vendor/f2c/s_copy.c	1
/src/igraph/vendor/lapack/dnapps.c	1
/src/igraph/vendor/lapack/dlaset.c	1
/src/igraph/vendor/lapack/dlartg.c	1
/src/igraph/vendor/f2c/pow_di.c	1
/src/igraph/vendor/lapack/dlarf.c	1
/src/igraph/vendor/lapack/iladlc.c	1
/src/igraph/vendor/lapack/iladlr.c	1
/src/igraph/vendor/lapack/dger.c	1
/src/igraph/vendor/lapack/dneupd.c	1
/src/igraph/vendor/lapack/dtrsen.c	1
/src/igraph/vendor/lapack/dlange.c	1
/src/igraph/vendor/lapack/dtrexc.c	1
/src/igraph/vendor/lapack/dlaexc.c	1
/src/igraph/vendor/lapack/dlasy2.c	1
/src/igraph/vendor/lapack/dswap.c	1
/src/igraph/vendor/lapack/dlarfx.c	1
/src/igraph/vendor/lapack/dtrsyl.c	1
/src/igraph/vendor/lapack/dlacn2.c	1
/src/igraph/vendor/lapack/dasum.c	1
/src/igraph/vendor/f2c/i_dnnt.c	1
/src/igraph/vendor/lapack/dgeqr2.c	1
/src/igraph/vendor/lapack/dorm2r.c	1
/src/igraph/vendor/lapack/dtrmm.c	1
/src/igraph/src/centrality/prpack.cpp	1
/src/igraph/src/centrality/prpack/prpack_igraph_graph.h	2
/src/igraph/src/centrality/prpack/prpack_base_graph.cpp	4
/src/igraph/src/centrality/prpack/prpack_igraph_graph.cpp	1
/src/igraph/src/centrality/prpack/prpack_solver.cpp	15
/src/igraph/src/centrality/prpack/prpack_utils.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_ge_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_result.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_gs_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_schur_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_scc_graph.cpp	5
/usr/local/bin/../include/c++/v1/stdexcept	1
/src/igraph/src/properties/constraint.c	1
/src/igraph/src/paths/sparsifier.c	3
/src/igraph/src/core/bitset.c	4
/src/igraph/src/misc/conversion.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/centrality/truss.cpp	4
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/properties/loops.c	1

Fuzzer: misc_algos_weighted

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	4532	72.1%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1751	27.8%
All colors	6283	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
3485	1835	igraph_i_minimum_spanning_tree_kruskal	call site: 01835	igraph_i_feedback_arc_set_ip_ti
105	506	igraph_vector_int_append	call site: 00506	igraph_i_eit_all_between
67	1452	igraph_bitset_destroy	call site: 01452	igraph_vit_create
55	1070	igraph_dqueue_int_pop	call site: 01070	igraph_i_eccentricity_unweighted
53	1629	igraph_feedback_arc_set	call site: 01629	igraph_i_feedback_arc_set_undirected
46	1400	igraph_adjlist_init	call site: 01400	igraph_get_shortest_path
43	830	avg_nearest_neighbor_degree_weighted	call site: 00830	igraph_maxdegree
36	6074	igraph_to_undirected	call site: 06074	igraph_create
30	317	igraph_neighbors	call site: 00317	igraph_neighbors
30	1233	igraph_vector_int_list_resize	call site: 01233	igraph_incident
28	1008	igraph_i_pseudo_diameter_dijkstra	call site: 01008	igraph_i_pseudo_diameter_unweighted
27	1555	igraph_i_average_path_length_dijkstra	call site: 01555	igraph_i_average_path_length_unweighted

Runtime coverage analysis

Covered functions

292

Functions that are reachable but not covered

652

Reachable functions

921

Percentage of reachable functions covered

29.21%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/misc_algos_weighted.cpp	1
/src/igraph/src/core/error.c	18
/src/igraph/src/core/vector.pmt	60
/src/igraph/src/graph/attributes.c	22
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	13
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/core/vector.c	3
/src/igraph/src/core/typed_list.pmt	18
/src/igraph/src/core/matrix.pmt	7
/src/igraph/src/misc/conversion.c	3
/src/igraph/src/properties/spectral.c	2
/src/igraph/src/graph/iterators.c	16
/src/igraph/src/properties/degrees.c	6
/src/igraph/src/misc/mixing.c	3
/src/igraph/src/paths/distances.c	7
/src/igraph/src/graph/adjlist.c	16
/src/igraph/src/core/indheap.c	27
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	9
/src/igraph/src/paths/shortest_paths.c	10
/src/igraph/src/core/progress.c	1
/src/igraph/src/paths/dijkstra.c	7
/src/igraph/src/paths/unweighted.c	4
/src/igraph/src/paths/bellman_ford.c	3
/src/igraph/src/core/bitset.c	4
/src/igraph/src/cycles/feedback_sets.c	9
/src/igraph/src/misc/spanning_trees.c	7
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/graph/visitors.c	1
/src/igraph/src/properties/dag.c	1
/src/igraph/vendor/glpk/env/error.c	4
/src/igraph/vendor/glpk/env/env.c	4
/src/igraph/vendor/glpk/env/tls.c	2
/src/igraph/src/internal/glpk_support.c	4
/src/igraph/vendor/glpk/env/dlsup.c	1
/src/igraph/vendor/glpk/env/stdout.c	4
/src/igraph/vendor/glpk/draft/glpapi09.c	12
/src/igraph/vendor/glpk/api/prob1.c	19
/src/igraph/vendor/glpk/env/alloc.c	5
/src/igraph/vendor/glpk/misc/dmp.c	5
/src/igraph/vendor/glpk/misc/avl.c	6
/src/igraph/vendor/glpk/draft/bfd.c	11
/src/igraph/vendor/glpk/bflib/fhvint.c	7
/src/igraph/vendor/glpk/bflib/lufint.c	3
/src/igraph/vendor/glpk/bflib/sva.c	9
/src/igraph/vendor/glpk/bflib/scfint.c	7
/src/igraph/vendor/glpk/bflib/btfint.c	5
/src/igraph/src/core/stack.pmt	8
/src/igraph/vendor/glpk/draft/glpapi06.c	14
/src/igraph/vendor/glpk/draft/glpios01.c	21
/src/igraph/vendor/glpk/env/time.c	2
/src/igraph/vendor/glpk/env/stdc.c	1
/src/igraph/vendor/glpk/misc/jd.c	2
/src/igraph/vendor/glpk/draft/glpios03.c	16
/src/igraph/vendor/glpk/draft/glpios12.c	4
/src/igraph/vendor/glpk/api/prob5.c	3
/src/igraph/vendor/glpk/api/prob4.c	5
/src/igraph/vendor/glpk/intopt/mirgen.c	21
/src/igraph/vendor/glpk/intopt/spv.c	8
/src/igraph/vendor/glpk/intopt/covgen.c	14
/src/igraph/vendor/glpk/api/prob2.c	12
/src/igraph/vendor/glpk/misc/fvs.c	6
/src/igraph/vendor/glpk/intopt/cfg2.c	2
/src/igraph/vendor/glpk/intopt/cfg1.c	9
/src/igraph/vendor/glpk/intopt/cfg.c	7
/src/igraph/vendor/glpk/draft/glpios02.c	8
/src/igraph/vendor/glpk/draft/glpapi12.c	13
/src/igraph/vendor/glpk/bflib/luf.c	10
/src/igraph/vendor/glpk/bflib/sgf.c	7
/src/igraph/vendor/glpk/bflib/btf.c	7
/src/igraph/vendor/glpk/misc/mc21a.c	1
/src/igraph/vendor/glpk/misc/mc13d.c	1
/src/igraph/vendor/glpk/simplex/spxprim.c	10
/src/igraph/vendor/glpk/simplex/spxprob.c	7
/src/igraph/vendor/glpk/simplex/spxat.c	6
/src/igraph/vendor/glpk/simplex/spxnt.c	8
/src/igraph/vendor/glpk/simplex/spxchuzc.c	7
/src/igraph/vendor/glpk/simplex/spxlp.c	12
/src/igraph/vendor/glpk/bflib/fhv.c	3
/src/igraph/vendor/glpk/bflib/scf.c	11
/src/igraph/vendor/glpk/bflib/ifu.c	6
/src/igraph/vendor/glpk/simplex/spxchuzr.c	5
/src/igraph/vendor/glpk/simplex/spydual.c	12
/src/igraph/vendor/glpk/simplex/spychuzr.c	7
/src/igraph/vendor/glpk/simplex/spychuzc.c	5
/src/igraph/vendor/glpk/npp/npp1.c	21
/src/igraph/vendor/glpk/npp/npp5.c	7
/src/igraph/vendor/glpk/npp/npp2.c	10
/src/igraph/vendor/glpk/npp/npp3.c	20
/src/igraph/vendor/glpk/draft/glpscl.c	13
/src/igraph/vendor/glpk/misc/round2n.c	1
/src/igraph/vendor/glpk/api/advbas.c	2
/src/igraph/vendor/glpk/misc/triang.c	1
/src/igraph/vendor/glpk/misc/gcd.c	2
/src/igraph/vendor/glpk/intopt/fpump.c	2
/src/igraph/vendor/glpk/misc/rng.c	5
/src/igraph/vendor/glpk/misc/rng1.c	2
/src/igraph/vendor/glpk/draft/glpapi13.c	3
/src/igraph/vendor/glpk/proxy/proxy1.c	1
/src/igraph/vendor/glpk/proxy/proxy.c	16
/src/igraph/vendor/glpk/npp/npp4.c	10
/src/igraph/vendor/glpk/draft/glpios09.c	12
/src/igraph/vendor/glpk/draft/glpapi10.c	1
/src/igraph/vendor/glpk/intopt/gmigen.c	2
/src/igraph/vendor/glpk/intopt/gmicut.c	1
/src/igraph/vendor/glpk/misc/ks.c	8
/src/igraph/vendor/glpk/misc/mt1.c	3
/src/igraph/vendor/glpk/intopt/clqcut.c	1
/src/igraph/vendor/glpk/misc/wclique.c	2
/src/igraph/vendor/glpk/misc/wclique1.c	2
/src/igraph/vendor/glpk/draft/glpios11.c	3
/src/igraph/src/connectivity/components.c	3
/src/igraph/src/paths/random_walk.c	4
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/paths/widest_paths.c	1
/src/igraph/src/misc/other.c	1
/src/igraph/src/graph/cattributes.c	7
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/core/strvector.c	8
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/paths/sparsifier.c	3

Fuzzer: write_all_gml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	3035	57.0%
gold	[1:9]	26	0.48%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	10	0.18%
lawngreen	50+	2247	42.2%
All colors	5318	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
2193	2522	igraph_read_graph_graphml	call site: 02522	xmlParseTryOrFinish
168	2346	igraph_read_graph_graphml	call site: 02346	xmlCtxtPushInput
51	1144	igraph_get_eid	call site: 01144	igraph_i_eit_all_between
37	2198	igraph_read_graph_graphml	call site: 02198	xmlInitParserInternal
23	1118	igraph_eit_create	call site: 01118	igraph_i_eit_pairs
22	1095	igraph_eit_create	call site: 01095	igraph_i_eit_create_allfromto
22	1811	igraph_write_graph_pajek	call site: 01811	igraph_vector_int_init
20	5237	igraph_ncol_yylex	call site: 05237	igraph_trie_get_len
18	4899	igraph_write_graph_lgl	call site: 04899	igraph_degree_1
17	2307	igraph_read_graph_graphml	call site: 02307	xmlGetThreadLocalStorage
13	10	igraph_read_graph_gml	call site: 00010	igraph_error_handler_abort
13	290	igraph_gml_tree_init_tree	call site: 00290	igraph_i_parse_real

Runtime coverage analysis

Covered functions

330

Functions that are reachable but not covered

650

Reachable functions

925

Percentage of reachable functions covered

29.73%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/write_all_gml.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	27
/src/igraph/src/io/gml.c	15
/src/igraph/src/io/gml-tree.c	16
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/core/vector.pmt	39
/src/igraph/build/src/io/parsers/gml-lexer.c	22
/src/igraph/build/src/io/parsers/gml-parser.c	5
/src/igraph/src/io/gml-parser.y	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	13
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/trie.c	12
/src/igraph/src/core/printing.c	2
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/io/leda.c	1
/src/igraph/src/graph/iterators.c	13
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/io/dot.c	3
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/io/pajek.c	2
/src/igraph/src/io/graphml.c	11
/src/libxml2-2.15.0/threads.c	9
/src/libxml2-2.15.0/dict.c	21
/src/libxml2-2.15.0/error.c	17
/src/libxml2-2.15.0/xmlmemory.c	1
/src/libxml2-2.15.0/globals.c	20
/src/libxml2-2.15.0/encoding.c	15
/src/libxml2-2.15.0/xpath.c	2
/src/libxml2-2.15.0/xmlIO.c	15
/src/libxml2-2.15.0/catalog.c	33
/src/libxml2-2.15.0/xmlschemastypes.c	1
/src/libxml2-2.15.0/relaxng.c	1
/src/libxml2-2.15.0/parser.c	148
/src/libxml2-2.15.0/parserInternals.c	38
/src/libxml2-2.15.0/SAX2.c	6
/src/libxml2-2.15.0/buf.c	19
/src/libxml2-2.15.0/hash.c	26
/src/libxml2-2.15.0/xmlstring.c	16
/src/libxml2-2.15.0/include/private/memory.h	1
/src/libxml2-2.15.0/tree.c	65
/src/libxml2-2.15.0/HTMLparser.c	2
/src/libxml2-2.15.0/include/private/parser.h	2
/src/libxml2-2.15.0/chvalid.c	1
/src/libxml2-2.15.0/entities.c	10
/src/libxml2-2.15.0/uri.c	35
/src/libxml2-2.15.0/valid.c	40
/src/libxml2-2.15.0/list.c	3
/src/libxml2-2.15.0/xmlregexp.c	4
/src/igraph/src/core/interruption.c	1
/src/igraph/src/io/lgl.c	4
/src/igraph/build/src/io/parsers/lgl-lexer.c	22
/src/igraph/build/src/io/parsers/lgl-parser.c	5
/src/igraph/src/io/lgl-parser.y	1
/src/igraph/src/io/ncol.c	4
/src/igraph/build/src/io/parsers/ncol-lexer.c	22
/src/igraph/build/src/io/parsers/ncol-parser.c	5
/src/igraph/src/io/ncol-parser.y	1

Fuzzer: spatial

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	766	67.6%
gold	[1:9]	1	0.08%
yellow	[10:29]	1	0.08%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	365	32.2%
All colors	1133	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
197	924	igraph_nearest_neighbor_graph	call site: 00924	igraph_error
137	506	igraph_incident	call site: 00506	igraph_create
67	239	igraph_error_type_t neighbor_helper , 1l>(igraph_t*, igraph_matrix_t const*, long, double, long, bool)	call site: 00239	_ZN9nanoflann6resizeINSt3__15arrayINS_15KDTreeBaseClassINS_24KDTreeSingleIndexAdaptorINS_10L2_AdaptorId16ig_point_adaptordmEES6_Li1ElEES7_S6_Li1ElE8IntervalELm1EEEEENS1_9enable_ifIXntsr10has_resizeIT_EE5valueEvE4typeERSD_m
52	726	igraph_to_undirected	call site: 00726	igraph_create
39	685	igraph_to_undirected	call site: 00685	igraph_fixed_vectorlist_convert
35	783	igraph_error_type_t neighbor_helper , 2l>(igraph_t*, igraph_matrix_t const*, long, double, long, bool)	call site: 00783	_ZN9nanoflann6resizeINSt3__15arrayINS_15KDTreeBaseClassINS_24KDTreeSingleIndexAdaptorINS_10L2_AdaptorId16ig_point_adaptordmEES6_Li2ElEES7_S6_Li2ElE8IntervalELm2EEEEENS1_9enable_ifIXntsr10has_resizeIT_EE5valueEvE4typeERSD_m
35	830	igraph_error_type_t neighbor_helper , 3l>(igraph_t*, igraph_matrix_t const*, long, double, long, bool)	call site: 00830	_ZN9nanoflann6resizeINSt3__15arrayINS_15KDTreeBaseClassINS_24KDTreeSingleIndexAdaptorINS_10L2_AdaptorId16ig_point_adaptordmEES6_Li3ElEES7_S6_Li3ElE8IntervalELm3EEEEENS1_9enable_ifIXntsr10has_resizeIT_EE5valueEvE4typeERSD_m
35	877	igraph_error_type_t neighbor_helper , -1l>(igraph_t*, igraph_matrix_t const*, long, double, long, bool)	call site: 00877	_ZN9nanoflann6resizeINSt3__16vectorINS_15KDTreeBaseClassINS_24KDTreeSingleIndexAdaptorINS_10L2_AdaptorId16ig_point_adaptordmEES6_Lin1ElEES7_S6_Lin1ElE8IntervalENS1_9allocatorISA_EEEEEENS1_9enable_ifIXsr10has_resizeIT_EE5valueEvE4typeERSF_m
30	468	igraph_to_undirected	call site: 00468	igraph_eit_create
21	320	igraph_error_type_t neighbor_helper , 1l>(igraph_t*, igraph_matrix_t const*, long, double, long, bool)	call site: 00320	_ZN9nanoflann6assignINSt3__15arrayIdLm1EEEdEENS1_9enable_ifIXntsr10has_assignIT_EE5valueEvE4typeERS5_mRKT0_
10	204	igraph_add_vertices	call site: 00204	igraph_vector_int_resize
9	19	igraph_vector_int_init	call site: 00019	igraph_error

Runtime coverage analysis

Covered functions

86

Functions that are reachable but not covered

445

Reachable functions

554

Percentage of reachable functions covered

19.68%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/spatial.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/core/matrix.pmt	6
/src/igraph/src/core/vector.pmt	27
/src/igraph/src/spatial/convex_hull.c	1
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/spatial/nearest_neighbor.cpp	11
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	4
/src/igraph/src/graph/attributes.c	7
/src/igraph/src/spatial/delaunay.c	1
/src/igraph/src/core/vector.c	2
/src/igraph/src/spatial/nanoflann_internal.hpp	20
/src/igraph/vendor/nanoflann/nanoflann.hpp	186
/src/igraph/src/core/interruption.c	1
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/misc/conversion.c	1
/src/igraph/src/graph/iterators.c	9
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8

Fuzzer: write_all_graphml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	2984	56.1%
gold	[1:9]	15	0.28%
yellow	[10:29]	97	1.82%
greenyellow	[30:49]	18	0.33%
lawngreen	50+	2204	41.4%
All colors	5318	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
2193	421	igraph_read_graph_graphml	call site: 00421	xmlParseTryOrFinish
168	245	igraph_read_graph_graphml	call site: 00245	xmlCtxtPushInput
51	3105	igraph_get_eid	call site: 03105	igraph_i_eit_all_between
37	23	igraph_read_graph_graphml	call site: 00023	xmlInitParserInternal
31	5237	igraph_ncol_yylex	call site: 05237	igraph_trie_get_len
26	3852	igraph_gml_yylex	call site: 03852	igraph_i_gml_merge
23	3079	igraph_eit_create	call site: 03079	igraph_i_eit_pairs
22	3056	igraph_eit_create	call site: 03056	igraph_i_eit_create_allfromto
20	4014	igraph_i_parse_real	call site: 04014	yysyntax_error
18	4899	igraph_write_graph_lgl	call site: 04899	igraph_degree_1
18	5020	igraph_trie_get_len	call site: 05020	igraph_i_parse_real
17	204	igraph_read_graph_graphml	call site: 00204	xmlGetThreadLocalStorage

Runtime coverage analysis

Covered functions

345

Functions that are reachable but not covered

650

Reachable functions

925

Percentage of reachable functions covered

29.73%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/write_all_graphml.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	27
/src/igraph/src/io/graphml.c	11
/src/libxml2-2.15.0/threads.c	9
/src/libxml2-2.15.0/dict.c	21
/src/libxml2-2.15.0/error.c	17
/src/libxml2-2.15.0/xmlmemory.c	1
/src/libxml2-2.15.0/globals.c	20
/src/libxml2-2.15.0/encoding.c	15
/src/libxml2-2.15.0/xpath.c	2
/src/libxml2-2.15.0/xmlIO.c	15
/src/libxml2-2.15.0/catalog.c	33
/src/libxml2-2.15.0/xmlschemastypes.c	1
/src/libxml2-2.15.0/relaxng.c	1
/src/igraph/src/core/vector.pmt	39
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/memory.c	1
/src/igraph/src/core/trie.c	12
/src/libxml2-2.15.0/parser.c	148
/src/libxml2-2.15.0/parserInternals.c	38
/src/libxml2-2.15.0/SAX2.c	6
/src/libxml2-2.15.0/buf.c	19
/src/libxml2-2.15.0/hash.c	26
/src/libxml2-2.15.0/xmlstring.c	16
/src/libxml2-2.15.0/include/private/memory.h	1
/src/libxml2-2.15.0/tree.c	65
/src/libxml2-2.15.0/HTMLparser.c	2
/src/libxml2-2.15.0/include/private/parser.h	2
/src/libxml2-2.15.0/chvalid.c	1
/src/libxml2-2.15.0/entities.c	10
/src/libxml2-2.15.0/uri.c	35
/src/libxml2-2.15.0/valid.c	40
/src/libxml2-2.15.0/list.c	3
/src/libxml2-2.15.0/xmlregexp.c	4
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/../core/typed_list.pmt	13
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/io/leda.c	1
/src/igraph/src/graph/iterators.c	13
/src/igraph/src/core/printing.c	2
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/io/dot.c	3
/src/igraph/src/io/gml.c	15
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/io/gml-tree.c	16
/src/igraph/build/src/io/parsers/gml-lexer.c	22
/src/igraph/build/src/io/parsers/gml-parser.c	5
/src/igraph/src/io/gml-parser.y	8
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/io/pajek.c	2
/src/igraph/src/io/lgl.c	4
/src/igraph/build/src/io/parsers/lgl-lexer.c	22
/src/igraph/build/src/io/parsers/lgl-parser.c	5
/src/igraph/src/io/lgl-parser.y	1
/src/igraph/src/io/ncol.c	4
/src/igraph/build/src/io/parsers/ncol-lexer.c	22
/src/igraph/build/src/io/parsers/ncol-parser.c	5
/src/igraph/src/io/ncol-parser.y	1

Fuzzer: vertex_connectivity

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	689	47.5%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	759	52.4%
All colors	1448	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
146	997	igraph_maxflow	call site: 00997	igraph_is_dag
75	639	igraph_incident	call site: 00639	igraph_i_eit_create_allfromto
53	339	igraph_vit_create	call site: 00339	igraph_neighbors
49	717	igraph_get_eid	call site: 00717	igraph_i_eit_all_between
47	1395	igraph_to_undirected	call site: 01395	igraph_create
39	1354	igraph_to_undirected	call site: 01354	igraph_fixed_vectorlist_convert
37	545	igraph_is_simple	call site: 00545	igraph_has_mutual
31	1292	igraph_to_undirected	call site: 01292	igraph_eit_create
28	1221	igraph_to_directed	call site: 01221	igraph_get_edgelist
23	838	igraph_maxflow	call site: 00838	igraph_i_maxflow_undirected
19	612	igraph_eit_create	call site: 00612	igraph_i_eit_create_allfromto
14	811	igraph_i_st_vertex_connectivity_check_errors	call site: 00811	igraph_count_multiple_1

Runtime coverage analysis

Covered functions

111

Functions that are reachable but not covered

69

Reachable functions

180

Percentage of reachable functions covered

61.67%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/vertex_connectivity.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	28
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	14
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	8
/src/igraph/src/core/vector.c	2
/src/igraph/src/flow/flow.c	13
/src/igraph/src/connectivity/components.c	3
/src/igraph/src/core/bitset.c	2
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	7
/src/igraph/src/graph/iterators.c	14
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/complete.c	1
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/flow/flow_conversion.c	1
/src/igraph/src/misc/conversion.c	3
/src/igraph/src/graph/basic_query.c	1
/src/igraph/src/core/buckets.c	14
/src/igraph/src/properties/dag.c	1
/src/igraph/src/random/random.c	10
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8

Fuzzer: basic_properties_undirected

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	440	39.7%
gold	[1:9]	2	0.18%
yellow	[10:29]	5	0.45%
greenyellow	[30:49]	2	0.18%
lawngreen	50+	658	59.4%
All colors	1107	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
63	561	igraph_adjlist_init	call site: 00561	igraph_adjlist_init
53	464	igraph_vit_create	call site: 00464	igraph_neighbors
48	1037	igraph_is_chordal	call site: 01037	igraph_add_edges
41	839	igraph_i_connected_components_weak	call site: 00839	igraph_i_connected_components_strong
34	627	igraph_is_acyclic	call site: 00627	igraph_is_forest
20	433	igraph_vector_int_clear	call site: 00433	igraph_adjlist_init
15	724	igraph_i_is_forest	call site: 00724	igraph_degree
10	103	igraph_add_vertices	call site: 00103	igraph_vector_int_resize
10	758	igraph_is_tree	call site: 00758	igraph_degree
9	10	igraph_vector_int_init	call site: 00010	igraph_error
9	1002	igraph_is_chordal	call site: 01002	igraph_vector_int_init
8	283	igraph_is_simple	call site: 00283	igraph_has_mutual

Runtime coverage analysis

Covered functions

94

Functions that are reachable but not covered

38

Reachable functions

132

Percentage of reachable functions covered

71.21%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/basic_properties_undirected.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	22
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	9
/src/igraph/src/graph/attributes.c	5
/src/igraph/src/core/vector.c	1
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/graph/adjlist.c	7
/src/igraph/src/properties/complete.c	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/misc/bipartite.c	1
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/connectivity/components.c	6
/src/igraph/src/core/bitset.c	2
/src/igraph/src/graph/iterators.c	4
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/trees.c	6
/src/igraph/src/properties/dag.c	1
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/paths/eulerian.c	3
/src/igraph/src/misc/chordality.c	2
/src/igraph/src/properties/basic_properties.c	1

Fuzzer: read_graphml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	2681	78.7%
gold	[1:9]	6	0.17%
yellow	[10:29]	14	0.41%
greenyellow	[30:49]	10	0.29%
lawngreen	50+	693	20.3%
All colors	3404	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
2193	421	igraph_read_graph_graphml	call site: 00421	xmlParseTryOrFinish
168	245	igraph_read_graph_graphml	call site: 00245	xmlCtxtPushInput
73	3259	igraph_eit_create	call site: 03259	igraph_i_eit_all_between
71	3187	igraph_eit_create	call site: 03187	igraph_i_eit_create_allfromto
37	23	igraph_read_graph_graphml	call site: 00023	xmlInitParserInternal
17	204	igraph_read_graph_graphml	call site: 00204	xmlGetThreadLocalStorage
14	8	LLVMFuzzerTestOneInput	call site: 00008	igraph_error
5	414	igraph_read_graph_graphml	call site: 00414	xmlFreeParserCtxt
5	3106	igraph_real_fprintf_precise	call site: 03106	igraph_error
4	75	igraph_i_graphml_parser_state_init	call site: 00075	igraph_fatalf
3	2879	igraph_i_property_cache_invalidate_conditionally	call site: 02879	igraph_i_property_cache_get_bool
2	144	igraph_i_trie_init_node	call site: 00144	igraph_fatalf

Runtime coverage analysis

Covered functions

214

Functions that are reachable but not covered

618

Reachable functions

750

Percentage of reachable functions covered

17.6%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_graphml.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/graph/attributes.c	25
/src/igraph/src/io/graphml.c	11
/src/libxml2-2.15.0/threads.c	9
/src/libxml2-2.15.0/dict.c	21
/src/libxml2-2.15.0/error.c	17
/src/libxml2-2.15.0/xmlmemory.c	1
/src/libxml2-2.15.0/globals.c	20
/src/libxml2-2.15.0/encoding.c	15
/src/libxml2-2.15.0/xpath.c	2
/src/libxml2-2.15.0/xmlIO.c	15
/src/libxml2-2.15.0/catalog.c	33
/src/libxml2-2.15.0/xmlschemastypes.c	1
/src/libxml2-2.15.0/relaxng.c	1
/src/igraph/src/core/vector.pmt	27
/src/igraph/src/core/vector_ptr.c	7
/src/igraph/src/core/strvector.c	12
/src/igraph/src/core/memory.c	1
/src/igraph/src/core/trie.c	7
/src/libxml2-2.15.0/parser.c	148
/src/libxml2-2.15.0/parserInternals.c	38
/src/libxml2-2.15.0/SAX2.c	6
/src/libxml2-2.15.0/buf.c	19
/src/libxml2-2.15.0/hash.c	26
/src/libxml2-2.15.0/xmlstring.c	16
/src/libxml2-2.15.0/include/private/memory.h	1
/src/libxml2-2.15.0/tree.c	65
/src/libxml2-2.15.0/HTMLparser.c	2
/src/libxml2-2.15.0/include/private/parser.h	2
/src/libxml2-2.15.0/chvalid.c	1
/src/libxml2-2.15.0/entities.c	10
/src/libxml2-2.15.0/uri.c	35
/src/libxml2-2.15.0/valid.c	40
/src/libxml2-2.15.0/list.c	3
/src/libxml2-2.15.0/xmlregexp.c	4
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/../core/typed_list.pmt	11
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/core/printing.c	1
/src/igraph/src/graph/iterators.c	11
/src/igraph/src/graph/type_common.c	1

Fuzzer: weighted_centrality

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	2525	65.4%
gold	[1:9]	1	0.02%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1332	34.5%
All colors	3858	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
1312	1542	strength_all	call site: 01542	igraph_arpack_rnsolve
144	3598	igraph_i_vector_int_order	call site: 03598	transitivity_local_undirected2
99	756	igraph_eit_create	call site: 00756	igraph_i_eit_all_between
64	2908	prpack::prpack_solver::solve_via_ge(double, double, int, double const*, double const*)	call site: 02908	log
60	3381	igraph_simplify	call site: 03381	igraph_delete_edges
47	1142	igraph_i_closeness_cutoff_weighted	call site: 01142	igraph_adjlist_init
46	1237	igraph_i_harmonic_centrality_weighted	call site: 01237	igraph_i_harmonic_centrality_unweighted
45	1474	igraph_vector_update	call site: 01474	igraph_strength
43	3331	igraph_to_undirected	call site: 03331	igraph_create
35	283	igraph_neighbors	call site: 00283	igraph_neighbors
33	538	igraph_betweenness_cutoff	call site: 00538	sspf
33	3818	transitivity_barrat4	call site: 03818	transitivity_barrat1

Runtime coverage analysis

Covered functions

229

Functions that are reachable but not covered

300

Reachable functions

541

Percentage of reachable functions covered

44.55%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/weighted_centrality.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/core/vector.pmt	47
/src/igraph/src/graph/attributes.c	25
/src/igraph/src/random/random.c	6
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	14
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/core/vector.c	2
/src/igraph/src/graph/iterators.c	18
/src/igraph/src/centrality/betweenness.c	9
/src/igraph/src/graph/adjlist.c	15
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/stack.pmt	8
/src/igraph/src/core/progress.c	1
/src/igraph/src/core/indheap.c	16
/src/igraph/src/math/utils.c	1
/src/igraph/src/core/dqueue.pmt	6
/src/igraph/src/centrality/closeness.c	5
/src/igraph/src/paths/shortest_paths.c	6
/src/igraph/src/centrality/pagerank.c	5
/src/igraph/src/linalg/arpack.c	10
/src/igraph/src/core/matrix.pmt	5
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/math/complex.c	6
/src/igraph/vendor/lapack/dnaupd.c	1
/src/igraph/vendor/lapack/arscnd.c	1
/src/igraph/vendor/f2c/s_cmp.c	1
/src/igraph/vendor/lapack/dlamch.c	1
/src/igraph/vendor/lapack/fortran_intrinsics.c	7
/src/igraph/vendor/lapack/lsame.c	1
/src/igraph/vendor/lapack/dnaup2.c	1
/src/igraph/vendor/f2c/pow_dd.c	1
/src/igraph/vendor/lapack/dgetv0.c	1
/src/igraph/vendor/lapack/dlarnv.c	1
/src/igraph/vendor/lapack/dlaruv.c	1
/src/igraph/vendor/lapack/dcopy.c	1
/src/igraph/vendor/lapack/ddot.c	1
/src/igraph/vendor/lapack/dnrm2.c	1
/src/igraph/vendor/lapack/dgemv.c	1
/src/igraph/vendor/lapack/xerbla.c	1
/src/igraph/vendor/f2c/wsfe.c	1
/src/igraph/vendor/f2c/err.c	5
/src/igraph/vendor/f2c/sfe.c	2
/src/igraph/vendor/f2c/sig_die.c	1
/src/igraph/vendor/f2c/close.c	2
/src/igraph/vendor/f2c/endfile.c	1
/src/igraph/vendor/f2c/open.c	4
/src/igraph/vendor/f2c/util.c	2
/src/igraph/vendor/f2c/fmt.c	13
/src/igraph/vendor/lapack/len_trim.c	1
/src/igraph/vendor/f2c/i_len.c	1
/src/igraph/vendor/f2c/s_stop.c	1
/src/igraph/vendor/lapack/dvout.c	1
/src/igraph/vendor/lapack/dnaitr.c	1
/src/igraph/vendor/lapack/dlabad.c	1
/src/igraph/vendor/f2c/d_lg10.c	1
/src/igraph/vendor/lapack/ivout.c	1
/src/igraph/vendor/lapack/dscal.c	1
/src/igraph/vendor/lapack/dlascl.c	1
/src/igraph/vendor/lapack/disnan.c	1
/src/igraph/vendor/lapack/dlaisnan.c	1
/src/igraph/vendor/lapack/daxpy.c	1
/src/igraph/vendor/lapack/dlanhs.c	1
/src/igraph/vendor/lapack/dlassq.c	1
/src/igraph/vendor/lapack/dmout.c	1
/src/igraph/vendor/lapack/dneigh.c	1
/src/igraph/vendor/lapack/dlacpy.c	1
/src/igraph/vendor/lapack/dlahqr.c	1
/src/igraph/vendor/lapack/dlarfg.c	1
/src/igraph/vendor/lapack/dlapy2.c	1
/src/igraph/vendor/f2c/d_sign.c	1
/src/igraph/vendor/lapack/dlanv2.c	1
/src/igraph/vendor/lapack/drot.c	1
/src/igraph/vendor/lapack/dtrevc.c	1
/src/igraph/vendor/lapack/dlaln2.c	1
/src/igraph/vendor/lapack/dladiv.c	3
/src/igraph/vendor/lapack/idamax.c	1
/src/igraph/vendor/lapack/dngets.c	1
/src/igraph/vendor/lapack/dsortc.c	1
/src/igraph/vendor/lapack/dnconv.c	1
/src/igraph/vendor/f2c/s_copy.c	1
/src/igraph/vendor/lapack/dnapps.c	1
/src/igraph/vendor/lapack/dlaset.c	1
/src/igraph/vendor/lapack/dlartg.c	1
/src/igraph/vendor/f2c/pow_di.c	1
/src/igraph/vendor/lapack/dlarf.c	1
/src/igraph/vendor/lapack/iladlc.c	1
/src/igraph/vendor/lapack/iladlr.c	1
/src/igraph/vendor/lapack/dger.c	1
/src/igraph/vendor/lapack/dneupd.c	1
/src/igraph/vendor/lapack/dtrsen.c	1
/src/igraph/vendor/lapack/dlange.c	1
/src/igraph/vendor/lapack/dtrexc.c	1
/src/igraph/vendor/lapack/dlaexc.c	1
/src/igraph/vendor/lapack/dlasy2.c	1
/src/igraph/vendor/lapack/dswap.c	1
/src/igraph/vendor/lapack/dlarfx.c	1
/src/igraph/vendor/lapack/dtrsyl.c	1
/src/igraph/vendor/lapack/dlacn2.c	1
/src/igraph/vendor/lapack/dasum.c	1
/src/igraph/vendor/f2c/i_dnnt.c	1
/src/igraph/vendor/lapack/dgeqr2.c	1
/src/igraph/vendor/lapack/dorm2r.c	1
/src/igraph/vendor/lapack/dtrmm.c	1
/src/igraph/src/centrality/prpack.cpp	1
/src/igraph/src/centrality/prpack/prpack_igraph_graph.h	2
/src/igraph/src/centrality/prpack/prpack_base_graph.cpp	4
/src/igraph/src/centrality/prpack/prpack_igraph_graph.cpp	1
/src/igraph/src/centrality/prpack/prpack_solver.cpp	15
/src/igraph/src/centrality/prpack/prpack_utils.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_ge_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_result.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_gs_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_schur_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_scc_graph.cpp	5
/usr/local/bin/../include/c++/v1/stdexcept	1
/src/igraph/src/properties/constraint.c	1
/src/igraph/src/graph/cattributes.c	8
/src/igraph/src/graph/../core/typed_list.pmt	7
/src/igraph/src/core/strvector.c	8
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/misc/conversion.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/properties/basic_properties.c	1
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/properties/triangles.c	8
/src/igraph/src/properties/loops.c	1

Fuzzer: community

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	1070	32.8%
gold	[1:9]	5	0.15%
yellow	[10:29]	3	0.09%
greenyellow	[30:49]	3	0.09%
lawngreen	50+	2179	66.8%
All colors	3260	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
98	1994	igraph_eit_create	call site: 01994	igraph_i_eit_all_between
68	2183	igraph_simplify	call site: 02183	igraph_delete_edges
63	2452	igraph_i_ecc3_1	call site: 02452	igraph_i_ecc4_1
58	715	igraph_i_connected_components_weak	call site: 00715	igraph_i_connected_components_strong
42	2766	igraph_to_undirected	call site: 02766	igraph_create
39	311	igraph_neighbors	call site: 00311	igraph_neighbors
37	2645	igraph_voronoi	call site: 02645	igraph_i_voronoi
31	613	igraph_community_label_propagation	call site: 00613	igraph_neighbors
28	2114	igraph_strength	call site: 02114	igraph_vit_create
25	777	igraph_vector_int_pop_back	call site: 00777	igraph_vector_int_push_back
25	2706	igraph_to_undirected	call site: 02706	igraph_eit_create
23	2270	igraph_simplify	call site: 02270	igraph_fixed_vectorlist_convert

Runtime coverage analysis

Covered functions

319

Functions that are reachable but not covered

87

Reachable functions

437

Percentage of reachable functions covered

80.09%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/community.cpp	1
/src/igraph/src/core/error.c	18
/src/igraph/src/core/vector.pmt	62
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	3
/src/igraph/src/graph/type_indexededgelist.c	16
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	1
/src/igraph/src/core/matrix.pmt	13
/src/igraph/src/community/label_propagation.c	3
/src/igraph/src/graph/adjlist.c	10
/src/igraph/src/graph/iterators.c	16
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	8
/src/igraph/src/community/walktrap/walktrap.cpp	1
/src/igraph/src/community/walktrap/walktrap_graph.cpp	8
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	3
/src/igraph/src/core/progress.c	1
/src/igraph/src/community/walktrap/walktrap_communities.cpp	17
/src/igraph/src/community/walktrap/walktrap_heap.cpp	9
/src/igraph/src/community/community_misc.c	10
/src/igraph/src/community/edge_betweenness.c	5
/src/igraph/src/core/indheap.c	16
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/math/utils.c	1
/src/igraph/src/community/modularity.c	3
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/community/leiden.c	8
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/core/sparsemat.c	24
/src/igraph/vendor/cs/cs_util.c	4
/src/igraph/vendor/cs/cs_malloc.c	4
/src/igraph/vendor/cs/cs_entry.c	1
/src/igraph/vendor/cs/cs_compress.c	1
/src/igraph/vendor/cs/cs_cumsum.c	1
/src/igraph/vendor/cs/cs_dupl.c	1
/src/igraph/src/operators/contract.c	1
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/misc/mixing.c	1
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/community/voronoi.c	9
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/properties/ecc.c	5
/src/igraph/src/paths/voronoi.c	3
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/community/fast_modularity.c	12
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/community/louvain.c	9
/src/igraph/src/community/fluid.c	1

Fuzzer: weighted_community

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	1298	33.5%
gold	[1:9]	5	0.12%
yellow	[10:29]	5	0.12%
greenyellow	[30:49]	2	0.05%
lawngreen	50+	2561	66.1%
All colors	3871	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
98	2191	igraph_eit_create	call site: 02191	igraph_i_eit_all_between
83	3760	igraph_community_spinglass	call site: 03760	igraph_is_connected
80	3590	PottsModel::HeatBathLookup(double, double, double, unsigned int)	call site: 03590	igraph_rng_get_integer
64	2325	igraph_simplify	call site: 02325	igraph_delete_edges
63	2623	igraph_i_ecc3_1	call site: 02623	igraph_i_ecc4_1
55	940	igraph_i_connected_components_weak	call site: 00940	igraph_i_connected_components_strong
40	421	igraph_neighbors	call site: 00421	igraph_neighbors
40	2936	igraph_to_undirected	call site: 02936	igraph_create
37	2815	igraph_voronoi	call site: 02815	igraph_i_voronoi
31	347	igraph_attribute_record_resize	call site: 00347	igraph_strvector_resize
31	841	igraph_community_label_propagation	call site: 00841	igraph_neighbors
23	999	igraph_vector_int_pop_back	call site: 00999	igraph_vector_int_push_back

Runtime coverage analysis

Covered functions

493

Functions that are reachable but not covered

138

Reachable functions

743

Percentage of reachable functions covered

81.43%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/weighted_community.cpp	1
/src/igraph/src/core/error.c	18
/src/igraph/src/core/vector.pmt	65
/src/igraph/src/graph/attributes.c	26
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	3
/src/igraph/src/graph/type_indexededgelist.c	16
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/core/vector.c	1
/src/igraph/src/core/matrix.pmt	13
/src/igraph/src/graph/cattributes.c	9
/src/igraph/src/graph/../core/typed_list.pmt	8
/src/igraph/src/core/strvector.c	8
/src/igraph/src/graph/iterators.c	16
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/community/label_propagation.c	3
/src/igraph/src/graph/adjlist.c	10
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	8
/src/igraph/src/community/walktrap/walktrap.cpp	1
/src/igraph/src/community/walktrap/walktrap_graph.cpp	8
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	3
/src/igraph/src/core/progress.c	1
/src/igraph/src/community/walktrap/walktrap_communities.cpp	17
/src/igraph/src/community/walktrap/walktrap_heap.cpp	9
/src/igraph/src/community/community_misc.c	10
/src/igraph/src/community/edge_betweenness.c	5
/src/igraph/src/core/indheap.c	16
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/math/utils.c	1
/src/igraph/src/community/modularity.c	3
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/community/leiden.c	8
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/core/sparsemat.c	24
/src/igraph/vendor/cs/cs_util.c	4
/src/igraph/vendor/cs/cs_malloc.c	4
/src/igraph/vendor/cs/cs_entry.c	1
/src/igraph/vendor/cs/cs_compress.c	1
/src/igraph/vendor/cs/cs_cumsum.c	1
/src/igraph/vendor/cs/cs_dupl.c	1
/src/igraph/src/operators/contract.c	1
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/community/voronoi.c	9
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/properties/ecc.c	5
/src/igraph/src/paths/voronoi.c	3
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/community/fast_modularity.c	12
/src/igraph/src/community/louvain.c	9
/src/igraph/src/community/spinglass/clustertool.cpp	3
/src/igraph/src/community/spinglass/NetDataTypes.h	101
/src/igraph/src/community/spinglass/NetRoutines.cpp	1
/src/igraph/src/community/spinglass/NetDataTypes.cpp	4
/src/igraph/src/community/spinglass/pottsmodel_2.cpp	17
/src/igraph/src/community/spinglass/pottsmodel_2.h	3

Fuzzer: read_pajek

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	511	40.2%
gold	[1:9]	2	0.15%
yellow	[10:29]	2	0.15%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	754	59.4%
All colors	1269	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
152	537	igraph_vector_push_back	call site: 00537	add_string_vertex_attribute
78	1051	igraph_eit_create	call site: 01051	igraph_i_eit_create_allfromto
75	1130	igraph_eit_create	call site: 01130	igraph_i_eit_all_between
26	509	igraph_attribute_record_list_get_ptr	call site: 00509	add_numeric_vertex_attribute
23	472	igraph_attribute_record_resize	call site: 00472	add_string_vertex_attribute
12	708	igraph_i_parse_real	call site: 00708	make_dynstr
10	263	igraph_bitset_resize	call site: 00263	add_bipartite_type
9	16	igraph_vector_int_init	call site: 00016	igraph_error
9	206	igraph_pajek_yylex	call site: 00206	igraph_pajek_yy_create_buffer
6	446	igraph_attribute_record_list_push_back_new	call site: 00446	igraph_attribute_record_resize
5	10	igraph_vector_int_init	call site: 00010	igraph_fatal_handler_abort
5	217	igraph_warningf	call site: 00217	igraph_pajek_yy_create_buffer

Runtime coverage analysis

Covered functions

207

Functions that are reachable but not covered

47

Reachable functions

226

Percentage of reachable functions covered

79.2%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_pajek.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	23
/src/igraph/src/io/pajek.c	4
/src/igraph/src/core/vector.pmt	26
/src/igraph/src/core/trie.c	9
/src/igraph/src/core/strvector.c	12
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/graph/../core/typed_list.pmt	12
/src/igraph/src/core/memory.c	1
/src/igraph/src/core/bitset.c	5
/src/igraph/build/src/io/parsers/pajek-lexer.c	22
/src/igraph/build/src/io/parsers/pajek-parser.c	5
/src/igraph/src/io/pajek-parser.y	19
/src/igraph/src/io/parse_utils.c	2
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	11
/src/igraph/src/core/printing.c	1

Fuzzer: basic_properties_directed

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	249	28.0%
gold	[1:9]	4	0.45%
yellow	[10:29]	3	0.33%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	632	71.1%
All colors	888	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
53	428	igraph_vit_create	call site: 00428	igraph_neighbors
30	843	igraph_is_eulerian	call site: 00843	igraph_i_is_eulerian_undirected
13	376	igraph_dqueue_int_pop	call site: 00376	igraph_neighbors
10	103	igraph_add_vertices	call site: 00103	igraph_vector_int_resize
9	10	igraph_vector_int_init	call site: 00010	igraph_error
5	4	igraph_vector_int_init	call site: 00004	igraph_fatal_handler_abort
5	357	igraph_dqueue_int_destroy	call site: 00357	igraph_dqueue_int_push
5	573	igraph_i_connected_components_strong	call site: 00573	igraph_vector_int_push_back
5	878	igraph_density	call site: 00878	igraph_error
4	40	igraph_empty_attrs	call site: 00040	igraph_fatalf
4	204	igraph_add_edges	call site: 00204	igraph_vector_int_resize
4	338	igraph_is_connected	call site: 00338	igraph_i_is_connected_weak

Runtime coverage analysis

Covered functions

93

Functions that are reachable but not covered

24

Reachable functions

117

Percentage of reachable functions covered

79.49%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/basic_properties_directed.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	16
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	10
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/graph/adjlist.c	7
/src/igraph/src/properties/complete.c	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	2
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/graph/iterators.c	4
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/dag.c	1
/src/igraph/src/properties/trees.c	5
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/paths/eulerian.c	3
/src/igraph/src/properties/basic_properties.c	1

Fuzzer: misc_algos

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	633	30.8%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	2	0.09%
lawngreen	50+	1417	69.0%
All colors	2052	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
72	1011	igraph_eit_create	call site: 01011	igraph_i_eit_create_allfromto
71	1086	igraph_eit_create	call site: 01086	igraph_i_eit_all_between
57	1204	igraph_i_lazy_adjlist_get_real	call site: 01204	igraph_i_ecc4_1
43	1993	igraph_to_undirected	call site: 01993	igraph_create
30	273	igraph_neighbors	call site: 00273	igraph_neighbors
30	1909	igraph_to_undirected	call site: 01909	igraph_eit_create
26	1532	igraph_i_induced_subgraph_suggest_implementation	call site: 01532	igraph_neighbors
23	1968	igraph_to_undirected	call site: 01968	igraph_fixed_vectorlist_convert
22	1471	igraph_i_random_walk_inclist	call site: 01471	igraph_vector_cumsum
16	929	LLVMFuzzerTestOneInput	call site: 00929	igraph_adjlist_init
15	1510	igraph_i_random_walk_inclist	call site: 01510	igraph_i_random_walk_adjlist
14	976	igraph_i_trans4_al_simplify	call site: 00976	igraph_vector_int_push_back

Runtime coverage analysis

Covered functions

212

Functions that are reachable but not covered

52

Reachable functions

261

Percentage of reachable functions covered

80.08%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/misc_algos.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	39
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	3
/src/igraph/src/graph/type_indexededgelist.c	18
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	2
/src/igraph/src/core/typed_list.pmt	28
/src/igraph/src/cycles/cycle_bases.c	6
/src/igraph/src/graph/iterators.c	20
/src/igraph/src/connectivity/components.c	3
/src/igraph/src/core/bitset.c	7
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	14
/src/igraph/src/core/progress.c	1
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/cycles/order_cycle.cpp	1
/src/igraph/src/misc/motifs.c	3
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/properties/triangles.c	2
/src/igraph/src/properties/ecc.c	5
/src/igraph/src/connectivity/reachability.c	3
/src/igraph/src/core/bitset_list.c	2
/src/igraph/src/paths/simple_paths.c	1
/src/igraph/src/paths/random_walk.c	4
/src/igraph/src/core/vector_ptr.c	6
/src/igraph/src/operators/subgraph.c	7
/src/igraph/src/operators/reverse.c	1
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/core/fixed_vectorlist.c	2

Fuzzer: vertex_separators

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	659	24.1%
gold	[1:9]	0	0.0%
yellow	[10:29]	1	0.03%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	2073	75.8%
All colors	2733	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
76	1647	igraph_simplify	call site: 01647	igraph_delete_edges
49	926	igraph_get_eid	call site: 00926	igraph_i_eit_all_between
46	877	igraph_eit_create	call site: 00877	igraph_i_eit_create_allfromto
33	1895	igraph_connected_components	call site: 01895	igraph_i_connected_components_weak
32	285	igraph_neighbors	call site: 00285	igraph_neighbors
26	1420	igraph_to_directed	call site: 01420	igraph_get_edgelist
25	2441	igraph_i_induced_subgraph_suggest_implementation	call site: 02441	igraph_neighbors
24	1202	igraph_maxflow	call site: 01202	igraph_vector_int_push_back
23	1046	igraph_maxflow	call site: 01046	igraph_i_maxflow_undirected
23	1743	igraph_simplify	call site: 01743	igraph_fixed_vectorlist_convert
18	1588	igraph_vector_int_list_push_back_new	call site: 01588	igraph_vector_int_list_push_back_new
16	1954	igraph_contract_vertices	call site: 01954	igraph_vector_int_list_init

Runtime coverage analysis

Covered functions

247

Functions that are reachable but not covered

49

Reachable functions

296

Percentage of reachable functions covered

83.45%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/vertex_separators.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	44
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	16
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	11
/src/igraph/src/core/vector.c	3
/src/igraph/src/core/typed_list.pmt	21
/src/igraph/src/connectivity/separators.c	10
/src/igraph/src/graph/adjlist.c	10
/src/igraph/src/graph/iterators.c	18
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	11
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/flow/flow.c	13
/src/igraph/src/connectivity/components.c	7
/src/igraph/src/core/bitset.c	3
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/complete.c	1
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/flow/flow_conversion.c	1
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/graph/basic_query.c	1
/src/igraph/src/core/buckets.c	14
/src/igraph/src/properties/dag.c	2
/src/igraph/src/random/random.c	10
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/flow/st-cuts.c	8
/src/igraph/src/operators/contract.c	1
/src/igraph/src/operators/permute.c	2
/src/igraph/src/core/marked_queue.c	8
/src/igraph/src/core/estack.c	5
/src/igraph/src/graph/visitors.c	1
/src/igraph/src/operators/add_edge.c	1
/src/igraph/src/connectivity/cohesive_blocks.c	4
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/operators/subgraph.c	5
/src/igraph/src/properties/degrees.c	1

Fuzzer: linear_algos_undirected

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	1648	40.6%
gold	[1:9]	5	0.12%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	2397	59.1%
All colors	4050	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
193	3755	igraph_i_get_all_shortest_paths_unweighted	call site: 03755	igraph_get_all_shortest_paths_dijkstra
135	2957	igraph_i_minimum_spanning_tree_unweighted	call site: 02957	igraph_i_minimum_spanning_tree_prim
129	2025	igraph_i_get_shortest_paths_unweighted	call site: 02025	igraph_i_get_shortest_paths_dijkstra
88	1878	igraph_edges	call site: 01878	igraph_i_distances_dijkstra_cutoff
82	749	igraph_is_connected	call site: 00749	igraph_i_connected_components_strong
75	3535	igraph_i_decompose_weak	call site: 03535	igraph_i_decompose_strong
68	1659	igraph_distances	call site: 01659	igraph_distances_floyd_warshall
64	2634	igraph_eulerian_path	call site: 02634	igraph_i_is_eulerian_directed
63	1301	igraph_i_is_graphical_undirected_simple	call site: 01301	igraph_i_is_graphical_directed_simple
52	2175	igraph_i_rng_get_uint32	call site: 02175	igraph_i_eccentricity_dijkstra
38	950	igraph_strength	call site: 00950	igraph_strength
38	2570	igraph_i_connected_components_weak	call site: 02570	igraph_i_connected_components_strong

Runtime coverage analysis

Covered functions

318

Functions that are reachable but not covered

126

Reachable functions

462

Percentage of reachable functions covered

72.73%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/linear_algos_undirected.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/core/vector.pmt	62
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	4
/src/igraph/src/graph/type_indexededgelist.c	18
/src/igraph/src/core/memory.c	2
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	2
/src/igraph/src/core/typed_list.pmt	18
/src/igraph/src/core/matrix.pmt	10
/src/igraph/src/cycles/feedback_sets.c	2
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/connectivity/components.c	11
/src/igraph/src/core/bitset.c	4
/src/igraph/src/graph/adjlist.c	15
/src/igraph/src/graph/iterators.c	21
/src/igraph/src/core/interruption.c	1
/src/igraph/src/misc/chordality.c	1
/src/igraph/src/centrality/coreness.c	1
/src/igraph/src/properties/girth.c	1
/src/igraph/src/core/dqueue.pmt	9
/src/igraph/src/core/progress.c	1
/src/igraph/src/misc/mixing.c	2
/src/igraph/src/properties/degrees.c	3
/src/igraph/src/properties/multiplicity.c	4
/src/igraph/src/properties/loops.c	3
/src/igraph/src/properties/basic_properties.c	1
/src/igraph/src/misc/graphicality.c	11
/src/igraph/src/misc/degree_sequence.cpp	26
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/paths/unweighted.c	4
/src/igraph/src/paths/dijkstra.c	4
/src/igraph/src/paths/floyd_warshall.c	4
/src/igraph/src/internal/utils.c	1
/src/igraph/src/core/indheap.c	28
/src/igraph/src/paths/johnson.c	1
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/paths/bellman_ford.c	2
/src/igraph/src/paths/distances.c	5
/src/igraph/src/random/random.c	11
/src/igraph/src/graph/visitors.c	3
/src/igraph/src/paths/eulerian.c	7
/src/igraph/src/misc/coloring.c	8
/src/igraph/src/internal/qsort.c	6
/src/igraph/src/core/genheap.c	14
/src/igraph/src/misc/spanning_trees.c	7
/src/igraph/src/operators/subgraph.c	5
/src/igraph/src/properties/trees.c	3
/src/igraph/src/constructors/prufer.c	1
/src/igraph/src/graph/../core/typed_list.pmt	10
/src/igraph/src/graph/graph_list.c	2
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/paths/all_shortest_paths.c	2
/src/igraph/src/core/vector_ptr.c	6
/src/igraph/src/math/utils.c	1
/src/igraph/src/operators/add_edge.c	1
/src/igraph/src/operators/rewire.c	2
/src/igraph/src/graph/basic_query.c	1

Fuzzer: linear_algos_directed

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	4859	68.4%
gold	[1:9]	2	0.02%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	4	0.05%
lawngreen	50+	2235	31.4%
All colors	7100	100

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked	Calltree index	Parent function	Callsite	Largest blocked function
3131	2760	igraph_vector_int_sort	call site: 02760	igraph_i_feedback_arc_set_ip_ti
198	6798	igraph_i_get_all_shortest_paths_unweighted	call site: 06798	igraph_get_all_shortest_paths_dijkstra
158	2558	igraph_feedback_arc_set	call site: 02558	igraph_i_feedback_arc_set_undirected
124	1843	igraph_i_get_shortest_paths_unweighted	call site: 01843	igraph_i_get_shortest_paths_dijkstra
115	1537	igraph_matrix_destroy	call site: 01537	igraph_i_distances_dijkstra_cutoff
87	1687	igraph_edges	call site: 01687	igraph_i_distances_dijkstra_cutoff
71	1465	igraph_distances	call site: 01465	igraph_distances_floyd_warshall
68	6192	igraph_eulerian_path	call site: 06192	igraph_i_is_eulerian_undirected
60	1244	igraph_vector_int_init_copy	call site: 01244	igraph_create
58	5896	igraph_vector_int_list_clear	call site: 05896	glp_intopt
52	1988	igraph_i_rng_get_uint32	call site: 01988	igraph_i_eccentricity_dijkstra
43	465	igraph_vit_create	call site: 00465	igraph_neighbors

Runtime coverage analysis

Covered functions

276

Functions that are reachable but not covered

732

Reachable functions

1009

Percentage of reachable functions covered

27.45%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/linear_algos_directed.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/core/vector.pmt	66
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	4
/src/igraph/src/graph/type_indexededgelist.c	19
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	3
/src/igraph/src/core/typed_list.pmt	18
/src/igraph/src/core/matrix.pmt	10
/src/igraph/src/cycles/feedback_sets.c	10
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/connectivity/components.c	7
/src/igraph/src/core/bitset.c	4
/src/igraph/src/core/dqueue.pmt	9
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	15
/src/igraph/src/graph/iterators.c	21
/src/igraph/src/core/progress.c	1
/src/igraph/src/centrality/coreness.c	1
/src/igraph/src/misc/mixing.c	2
/src/igraph/src/properties/degrees.c	3
/src/igraph/src/properties/multiplicity.c	5
/src/igraph/src/properties/loops.c	3
/src/igraph/src/properties/basic_properties.c	2
/src/igraph/src/misc/graphicality.c	11
/src/igraph/src/misc/degree_sequence.cpp	28
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/paths/unweighted.c	4
/src/igraph/src/paths/dijkstra.c	4
/src/igraph/src/paths/floyd_warshall.c	4
/src/igraph/src/internal/utils.c	1
/src/igraph/src/core/indheap.c	27
/src/igraph/src/paths/johnson.c	1
/src/igraph/src/misc/conversion.c	1
/src/igraph/src/paths/bellman_ford.c	2
/src/igraph/src/paths/distances.c	5
/src/igraph/src/random/random.c	11
/src/igraph/src/graph/visitors.c	3
/src/igraph/src/operators/reverse.c	1
/src/igraph/src/flow/st-cuts.c	9
/src/igraph/src/properties/trees.c	1
/src/igraph/src/properties/dag.c	2
/src/igraph/src/misc/spanning_trees.c	7
/src/igraph/src/internal/qsort.c	6
/src/igraph/vendor/glpk/env/error.c	4
/src/igraph/vendor/glpk/env/env.c	4
/src/igraph/vendor/glpk/env/tls.c	2
/src/igraph/src/internal/glpk_support.c	4
/src/igraph/vendor/glpk/env/dlsup.c	1
/src/igraph/vendor/glpk/env/stdout.c	4
/src/igraph/vendor/glpk/draft/glpapi09.c	12
/src/igraph/vendor/glpk/api/prob1.c	19
/src/igraph/vendor/glpk/env/alloc.c	5
/src/igraph/vendor/glpk/misc/dmp.c	5
/src/igraph/vendor/glpk/misc/avl.c	6
/src/igraph/vendor/glpk/draft/bfd.c	11
/src/igraph/vendor/glpk/bflib/fhvint.c	7
/src/igraph/vendor/glpk/bflib/lufint.c	3
/src/igraph/vendor/glpk/bflib/sva.c	9
/src/igraph/vendor/glpk/bflib/scfint.c	7
/src/igraph/vendor/glpk/bflib/btfint.c	5
/src/igraph/vendor/glpk/draft/glpapi06.c	14
/src/igraph/vendor/glpk/draft/glpios01.c	21
/src/igraph/vendor/glpk/env/time.c	2
/src/igraph/vendor/glpk/env/stdc.c	1
/src/igraph/vendor/glpk/misc/jd.c	2
/src/igraph/vendor/glpk/draft/glpios03.c	16
/src/igraph/vendor/glpk/draft/glpios12.c	4
/src/igraph/vendor/glpk/api/prob5.c	3
/src/igraph/vendor/glpk/api/prob4.c	5
/src/igraph/vendor/glpk/intopt/mirgen.c	21
/src/igraph/vendor/glpk/intopt/spv.c	8
/src/igraph/vendor/glpk/intopt/covgen.c	14
/src/igraph/vendor/glpk/api/prob2.c	12
/src/igraph/vendor/glpk/misc/fvs.c	6
/src/igraph/vendor/glpk/intopt/cfg2.c	2
/src/igraph/vendor/glpk/intopt/cfg1.c	9
/src/igraph/vendor/glpk/intopt/cfg.c	7
/src/igraph/vendor/glpk/draft/glpios02.c	8
/src/igraph/vendor/glpk/draft/glpapi12.c	13
/src/igraph/vendor/glpk/bflib/luf.c	10
/src/igraph/vendor/glpk/bflib/sgf.c	7
/src/igraph/vendor/glpk/bflib/btf.c	7
/src/igraph/vendor/glpk/misc/mc21a.c	1
/src/igraph/vendor/glpk/misc/mc13d.c	1
/src/igraph/vendor/glpk/simplex/spxprim.c	10
/src/igraph/vendor/glpk/simplex/spxprob.c	7
/src/igraph/vendor/glpk/simplex/spxat.c	6
/src/igraph/vendor/glpk/simplex/spxnt.c	8
/src/igraph/vendor/glpk/simplex/spxchuzc.c	7
/src/igraph/vendor/glpk/simplex/spxlp.c	12
/src/igraph/vendor/glpk/bflib/fhv.c	3
/src/igraph/vendor/glpk/bflib/scf.c	11
/src/igraph/vendor/glpk/bflib/ifu.c	6
/src/igraph/vendor/glpk/simplex/spxchuzr.c	5
/src/igraph/vendor/glpk/simplex/spydual.c	12
/src/igraph/vendor/glpk/simplex/spychuzr.c	7
/src/igraph/vendor/glpk/simplex/spychuzc.c	5
/src/igraph/vendor/glpk/npp/npp1.c	21
/src/igraph/vendor/glpk/npp/npp5.c	7
/src/igraph/vendor/glpk/npp/npp2.c	10
/src/igraph/vendor/glpk/npp/npp3.c	20
/src/igraph/vendor/glpk/draft/glpscl.c	13
/src/igraph/vendor/glpk/misc/round2n.c	1
/src/igraph/vendor/glpk/api/advbas.c	2
/src/igraph/vendor/glpk/misc/triang.c	1
/src/igraph/vendor/glpk/misc/gcd.c	2
/src/igraph/vendor/glpk/intopt/fpump.c	2
/src/igraph/vendor/glpk/misc/rng.c	5
/src/igraph/vendor/glpk/misc/rng1.c	2
/src/igraph/vendor/glpk/draft/glpapi13.c	3
/src/igraph/vendor/glpk/proxy/proxy1.c	1
/src/igraph/vendor/glpk/proxy/proxy.c	16
/src/igraph/vendor/glpk/npp/npp4.c	10
/src/igraph/vendor/glpk/draft/glpios09.c	12
/src/igraph/vendor/glpk/draft/glpapi10.c	1
/src/igraph/vendor/glpk/intopt/gmigen.c	2
/src/igraph/vendor/glpk/intopt/gmicut.c	1
/src/igraph/vendor/glpk/misc/ks.c	8
/src/igraph/vendor/glpk/misc/mt1.c	3
/src/igraph/vendor/glpk/intopt/clqcut.c	1
/src/igraph/vendor/glpk/misc/wclique.c	2
/src/igraph/vendor/glpk/misc/wclique1.c	2
/src/igraph/vendor/glpk/draft/glpios11.c	3
/src/igraph/src/paths/eulerian.c	7
/src/igraph/src/graph/../core/typed_list.pmt	10
/src/igraph/src/graph/graph_list.c	2
/src/igraph/src/operators/subgraph.c	4
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/paths/all_shortest_paths.c	2
/src/igraph/src/core/vector_ptr.c	6
/src/igraph/src/math/utils.c	1
/src/igraph/src/operators/add_edge.c	1
/src/igraph/src/operators/rewire.c	2
/src/igraph/src/graph/basic_query.c	1