GroteGnoom

export attribute printing

5

attribute examples that want to print results now define their own attribute printing function. This PR exports attribute printing so it's available to everyone and can be used in examples.

for the weighted, undirected case, when `igraph_local_scan_k_ecount` is called it with k=1 it will handle it itself, but when `igraph_local_scan_1_ecount` is called, it's passed on to `igraph_i_local_scan_1_sumweights`. They are now...

Add get_adjacency_submatrix

8

Fixes #2196

add cutoff versions of shortest path functions

6

fixes #2358

Direct betweenness

7

Fixes #1796 Making cutoffs work seems like a lot of work, because the only shortest path functions with cutoffs are `igraph_distances_cutoff`, `igraph_distances_dijkstra_cutoff`, which don't actually give me the paths. subset...

add astar benchmark

4

part of #2300 ``` |> Benchmark file: /home/daniel/Documents/igraph/tests/benchmarks/error_checking.c | singleton graph 0s 0s 0s | graph with 50000000 nodes, no edges 0.061s 0.01s 0.052s | vector init of 50000000 0s...

Performance impact of error checking and other fixed overhead

7

Because of the discussion that started here: https://github.com/igraph/igraph/pull/2240#issuecomment-1399479647 I feel like we (or at least I) haven't been too careful about the effects of fixed overhead on performance. In some...

Add graph6

1

Lots of work still to be done, like directed graphs, but also cleanup. Ref: #1074.