[med-svn] [Git][med-team/igraph][master] 5 commits: New upstream version 1.0.0

[Jérôme Benoit (@calculus)]

Jérôme Benoit pushed to branch master at Debian Med / igraph


Commits:
116f3828 by Jerome Benoit at 2025-10-05T22:47:56+02:00
New upstream version 1.0.0
- - - - -
e297509f by Jerome Benoit at 2025-10-05T22:48:09+02:00
Update upstream source from tag 'upstream/1.0.0'

Update to upstream version '1.0.0'
with Debian dir ff58b44c3d0cfe9605ec6fc37eabebcabae6275e
- - - - -
f47c6c39 by Jerome Benoit at 2025-10-05T22:48:26+02:00
New upstream version 1.0.0+ds
- - - - -
7440f0ce by Jerome Benoit at 2025-10-05T22:48:31+02:00
Update upstream source from tag 'upstream/1.0.0+ds'

Update to upstream version '1.0.0+ds'
with Debian dir ff58b44c3d0cfe9605ec6fc37eabebcabae6275e
- - - - -
61169719 by Jerome Benoit at 2025-10-06T01:31:40+02:00
Debian patch 1.0.0+ds-1

- - - - -


1284 changed files:

- ACKNOWLEDGEMENTS.md
- CHANGELOG.md
- CMakeLists.txt
- CONTRIBUTING.md
- CONTRIBUTORS.md
- CONTRIBUTORS.txt
- IGRAPH_VERSION
- README.md
- + VERSIONING.md
- debian/changelog
- debian/control
- debian/copyright
- − debian/libigraph3t64.lintian-overrides
- − debian/libigraph3t64.symbols
- debian/libigraph3t64.install → debian/libigraph4.install
- + debian/libigraph4.symbols
- debian/patches/debianization.patch
- debian/patches/series
- − debian/patches/upstream-fix-lintian-spelling_error-silence.patch
- doc/CMakeLists.txt
- doc/attributes.xxml
- doc/basicigraph.xxml
- doc/bipartite.xxml
- doc/coloring.xxml
- doc/community.xxml
- doc/cycles.xxml
- doc/doxrox.py
- doc/foreign.xxml
- + doc/games.xxml
- doc/generators.xxml
- + doc/glossary.md
- + doc/glossary.xml
- + doc/igraph-docs.info
- doc/igraph-docs.xml
- doc/installation.xml
- doc/isomorphism.xxml
- doc/iterators.xxml
- doc/layout.xxml
- doc/arpack.xxml → doc/linalg.xxml
- doc/matrix.xxml
- doc/motifs.xxml
- doc/nongraph.xxml
- doc/operators.xxml
- doc/pmt.xml
- doc/spatialgames.xxml → doc/processes.xxml
- doc/progress.xxml
- doc/sparsemat.xxml
- + doc/spatial.xxml
- doc/structural.xxml
- doc/strvector.xxml
- doc/tutorial.xml
- doc/vector.xxml
- doc/vectorlist.xxml
- doc/visitors.xxml
- etc/cmake/cpack_install_script.cmake
- etc/cmake/dependencies.cmake
- etc/cmake/features.cmake
- etc/cmake/packaging.cmake
- etc/cmake/summary.cmake
- examples/simple/adjlist.c
- examples/simple/bellman_ford.c
- examples/simple/blas.c
- examples/simple/blas_dgemm.c
- examples/simple/cattributes.c
- examples/simple/cattributes2.c
- examples/simple/cattributes3.c
- examples/simple/cattributes4.c
- examples/simple/centralization.c
- examples/simple/cohesive_blocks.c
- examples/simple/igraph_coloring.c → examples/simple/coloring.c
- examples/simple/creation.c
- examples/simple/distances.c
- examples/simple/dominator_tree.c
- examples/simple/dot.c
- examples/simple/dqueue.c
- examples/simple/eigenvector_centrality.c
- examples/simple/even_tarjan.c
- examples/simple/flow.c
- examples/simple/flow2.c
- examples/simple/foreign.c
- examples/simple/gml.c
- examples/simple/graphml.c
- examples/simple/igraph_all_st_mincuts.c
- examples/simple/igraph_assortativity_degree.c
- examples/simple/igraph_assortativity_nominal.c
- examples/simple/igraph_atlas.c
- examples/simple/igraph_attribute_combination.c
- examples/simple/igraph_average_path_length.c
- examples/simple/igraph_avg_nearest_neighbor_degree.c
- examples/simple/igraph_barabasi_game.c
- examples/simple/igraph_barabasi_game2.c
- examples/simple/igraph_bfs.c
- examples/simple/igraph_bfs_callback.c
- examples/simple/igraph_bfs_simple.c
- examples/simple/igraph_biconnected_components.c
- examples/simple/igraph_bipartite_create.c
- examples/simple/igraph_bipartite_projection.c
- examples/simple/igraph_cliques.c
- examples/simple/igraph_cocitation.c
- examples/simple/igraph_community_edge_betweenness.c
- examples/simple/igraph_community_edge_betweenness.out
- examples/simple/igraph_community_fastgreedy.c
- examples/simple/igraph_community_label_propagation.c
- examples/simple/igraph_community_leading_eigenvector.c
- examples/simple/igraph_community_leiden.c
- examples/simple/igraph_community_leiden.out
- examples/simple/igraph_community_multilevel.c
- examples/simple/igraph_community_optimal_modularity.c
- + examples/simple/igraph_community_optimal_modularity.out
- examples/simple/igraph_complementer.c
- examples/simple/igraph_compose.c
- examples/simple/igraph_contract_vertices.c
- examples/simple/igraph_copy.c
- examples/simple/igraph_create.c
- examples/simple/igraph_decompose.c
- examples/simple/igraph_degree.c
- examples/simple/igraph_degree_sequence_game.c
- examples/simple/igraph_delete_edges.c
- examples/simple/igraph_delete_vertices.c
- − examples/simple/igraph_deterministic_optimal_imitation.c
- examples/simple/igraph_diameter.c
- examples/simple/igraph_diameter.out
- examples/simple/igraph_difference.c
- examples/simple/igraph_disjoint_union.c
- examples/simple/igraph_eccentricity.c
- examples/simple/igraph_erdos_renyi_game_gnm.c
- examples/simple/igraph_erdos_renyi_game_gnp.c
- examples/simple/igraph_es_pairs.c
- examples/simple/igraph_feedback_arc_set.c
- examples/simple/igraph_feedback_arc_set_ip.c
- examples/simple/igraph_fisher_yates_shuffle.c
- examples/simple/igraph_full.c
- examples/simple/igraph_get_all_shortest_paths_dijkstra.c
- examples/simple/igraph_get_eid.c
- examples/simple/igraph_get_eids.c
- examples/simple/igraph_get_laplacian.c
- examples/simple/igraph_get_laplacian_sparse.c
- examples/simple/igraph_get_shortest_paths.c
- examples/simple/igraph_get_shortest_paths_dijkstra.c
- examples/simple/igraph_girth.c
- examples/simple/igraph_grg_game.c
- examples/simple/igraph_has_multiple.c
- examples/simple/igraph_independent_sets.c
- examples/simple/igraph_independent_sets.out
- examples/simple/igraph_intersection.c
- examples/simple/igraph_is_biconnected.c
- examples/simple/igraph_is_directed.c
- examples/simple/igraph_is_loop.c
- examples/simple/igraph_is_minimal_separator.c
- examples/simple/igraph_is_multiple.c
- examples/simple/igraph_is_separator.c
- examples/simple/igraph_isomorphic_vf2.c
- examples/simple/igraph_join.c
- examples/simple/igraph_kary_tree.c
- examples/simple/igraph_lapack_dgeev.c
- examples/simple/igraph_lapack_dgeevx.c
- examples/simple/igraph_lapack_dgesv.c
- examples/simple/igraph_lapack_dsyevr.c
- examples/simple/igraph_layout_reingold_tilford.c
- examples/simple/igraph_lcf.c
- + examples/simple/igraph_lcf.out
- examples/simple/igraph_list_triangles.c
- examples/simple/igraph_maximal_cliques.c
- examples/simple/igraph_maximum_bipartite_matching.c
- examples/simple/igraph_mincut.c
- examples/simple/igraph_minimal_separators.c
- examples/simple/igraph_minimum_size_separators.c
- examples/simple/igraph_minimum_spanning_tree.c
- examples/simple/igraph_minimum_spanning_tree.out
- examples/simple/igraph_motifs_randesu.c
- examples/simple/igraph_neighbors.c
- examples/simple/igraph_pagerank.c
- examples/simple/igraph_power_law_fit.c
- examples/simple/igraph_radius.c
- examples/simple/igraph_random_sample.c
- examples/simple/igraph_read_graph_dl.c
- examples/simple/igraph_read_graph_graphdb.c
- examples/simple/igraph_read_graph_lgl.c
- examples/simple/igraph_realize_degree_sequence.c
- examples/simple/igraph_realize_degree_sequence.out
- examples/simple/igraph_reciprocity.c
- examples/simple/igraph_regular_tree.c
- examples/simple/igraph_ring.c
- − examples/simple/igraph_roulette_wheel_imitation.c
- examples/simple/igraph_similarity.c
- examples/simple/igraph_simplify.c
- examples/simple/igraph_small.c
- examples/simple/igraph_sparsemat.c
- examples/simple/igraph_sparsemat3.c
- examples/simple/igraph_sparsemat4.c
- examples/simple/igraph_sparsemat6.c
- examples/simple/igraph_sparsemat7.c
- examples/simple/igraph_sparsemat8.c
- examples/simple/igraph_star.c
- − examples/simple/igraph_stochastic_imitation.c
- examples/simple/igraph_strvector.c
- examples/simple/igraph_subisomorphic_lad.c
- examples/simple/igraph_symmetric_tree.c
- examples/simple/igraph_to_undirected.c
- examples/simple/igraph_topological_sorting.c
- examples/simple/igraph_transitivity.c
- examples/simple/igraph_union.c
- examples/simple/igraph_vector_int_list_sort.c
- examples/simple/igraph_version.c
- examples/simple/igraph_vs_nonadj.c
- examples/simple/igraph_vs_range.c
- examples/simple/igraph_vs_vector.c
- examples/simple/igraph_weighted_adjacency.c
- examples/simple/igraph_weighted_adjacency.out
- examples/simple/igraph_write_graph_lgl.c
- examples/simple/igraph_write_graph_pajek.c
- examples/simple/random_seed.c
- examples/simple/safelocale.c
- examples/simple/walktrap.c
- examples/tutorial/tutorial1.c
- examples/tutorial/tutorial2.c
- examples/tutorial/tutorial3.c
- include/igraph.h
- include/igraph_adjlist.h
- include/igraph_arpack.h
- − include/igraph_array_pmt.h
- include/igraph_attributes.h
- include/igraph_bipartite.h
- include/igraph_bitset.h
- include/igraph_bitset_list.h
- include/igraph_blas.h
- include/igraph_centrality.h
- include/igraph_cliques.h
- include/igraph_cocitation.h
- include/igraph_cohesive_blocks.h
- include/igraph_coloring.h
- include/igraph_community.h
- include/igraph_complex.h
- include/igraph_components.h
- include/igraph_config.h.in
- include/igraph_constants.h
- include/igraph_constructors.h
- include/igraph_conversion.h
- include/igraph_cycles.h
- include/igraph_datatype.h
- include/igraph_decls.h
- include/igraph_dqueue.h
- include/igraph_dqueue_pmt.h
- include/igraph_eigen.h
- include/igraph_embedding.h
- include/igraph_epidemics.h
- include/igraph_error.h
- include/igraph_eulerian.h
- include/igraph_flow.h
- include/igraph_foreign.h
- include/igraph_games.h
- include/igraph_graph_list.h
- include/igraph_graphicality.h
- include/igraph_graphlets.h
- include/igraph_heap.h
- include/igraph_heap_pmt.h
- include/igraph_hrg.h
- include/igraph_interface.h
- include/igraph_interrupt.h
- include/igraph_topology.h → include/igraph_isomorphism.h
- include/igraph_iterators.h
- include/igraph_lapack.h
- include/igraph_layout.h
- include/igraph_lsap.h
- include/igraph_matching.h
- include/igraph_matrix.h
- include/igraph_matrix_list.h
- include/igraph_matrix_pmt.h
- include/igraph_memory.h
- − include/igraph_microscopic_update.h
- include/igraph_mixing.h
- include/igraph_motifs.h
- include/igraph_neighborhood.h
- include/igraph_nongraph.h
- include/igraph_operators.h
- include/igraph_paths.h
- include/igraph_pmt.h
- include/igraph_pmt_off.h
- include/igraph_progress.h
- include/igraph_psumtree.h
- include/igraph_qsort.h
- include/igraph_random.h
- include/igraph_reachability.h
- + include/igraph_sampling.h
- include/igraph_scan.h
- include/igraph_separators.h
- examples/simple/igraph_adjacency.c → include/igraph_setup.h
- include/igraph_sparsemat.h
- + include/igraph_spatial.h
- include/igraph_stack.h
- include/igraph_stack_pmt.h
- include/igraph_statusbar.h
- include/igraph_structural.h
- include/igraph_strvector.h
- include/igraph_threading.h.in
- include/igraph_transitivity.h
- include/igraph_typed_list_pmt.h
- include/igraph_types.h
- include/igraph_vector.h
- include/igraph_vector_list.h
- include/igraph_vector_pmt.h
- include/igraph_vector_ptr.h
- include/igraph_vector_type.h
- include/igraph_version.h.in
- include/igraph_visitor.h
- interfaces/functions.yaml
- interfaces/types.yaml
- src/CMakeLists.txt
- src/centrality/betweenness.c
- src/centrality/centrality_internal.h
- src/centrality/centrality_other.c
- src/centrality/centralization.c
- src/centrality/closeness.c
- src/centrality/coreness.c
- src/centrality/eigenvector.c
- src/centrality/hub_authority.c
- src/centrality/pagerank.c
- src/centrality/prpack.cpp
- src/centrality/prpack/prpack_igraph_graph.cpp
- src/centrality/prpack_internal.h
- src/centrality/truss.cpp
- src/cliques/cliquer/cliquer.c
- src/cliques/cliquer_internal.h
- src/cliques/cliquer_wrapper.c
- src/cliques/cliques.c
- src/cliques/glet.c
- src/cliques/maximal_cliques.c
- src/cliques/maximal_cliques_template.h
- + src/community/community_internal.h
- src/community/community_misc.c
- src/community/edge_betweenness.c
- src/community/fast_modularity.c
- src/community/fluid.c
- + src/community/infomap.cpp
- − src/community/infomap/infomap.cc
- − src/community/infomap/infomap_FlowGraph.cc
- − src/community/infomap/infomap_FlowGraph.h
- − src/community/infomap/infomap_Greedy.cc
- − src/community/infomap/infomap_Greedy.h
- src/community/label_propagation.c
- src/community/leading_eigenvector.c
- src/community/leiden.c
- src/community/louvain.c
- src/community/modularity.c
- src/community/optimal_modularity.c
- src/community/spinglass/NetDataTypes.cpp
- src/community/spinglass/NetDataTypes.h
- src/community/spinglass/NetRoutines.cpp
- src/community/spinglass/NetRoutines.h
- src/community/spinglass/clustertool.cpp
- src/community/spinglass/pottsmodel_2.cpp
- src/community/spinglass/pottsmodel_2.h
- src/community/voronoi.c
- src/community/walktrap/walktrap.cpp
- src/community/walktrap/walktrap_communities.cpp
- src/community/walktrap/walktrap_communities.h
- src/community/walktrap/walktrap_graph.cpp
- src/community/walktrap/walktrap_graph.h
- src/community/walktrap/walktrap_heap.cpp
- src/community/walktrap/walktrap_heap.h
- src/config.h.in
- src/connectivity/cohesive_blocks.c
- src/connectivity/components.c
- + src/connectivity/percolation.c
- src/connectivity/reachability.c
- src/connectivity/separators.c
- src/constructors/adjacency.c
- src/constructors/atlas-edges.h
- src/constructors/atlas.c
- src/constructors/basic_constructors.c
- src/constructors/circulant.c
- src/constructors/de_bruijn.c
- src/constructors/famous.c
- src/constructors/full.c
- src/constructors/generalized_petersen.c
- src/constructors/kautz.c
- src/constructors/lattices.c
- src/constructors/lcf.c
- src/constructors/linegraph.c
- + src/constructors/mycielskian.c
- src/constructors/prufer.c
- src/constructors/regular.c
- src/constructors/trees.c
- − src/core/array.pmt
- src/core/bitset.c
- src/core/bitset_list.c
- src/core/buckets.c
- src/core/buckets.h
- src/core/cutheap.c
- src/core/cutheap.h
- src/core/dqueue.c
- src/core/dqueue.pmt
- src/core/error.c
- src/core/estack.c
- src/core/estack.h
- src/core/fixed_vectorlist.c
- src/core/fixed_vectorlist.h
- src/core/genheap.c
- src/core/genheap.h
- src/core/grid.c
- src/core/grid.h
- src/core/heap.c
- src/core/heap.pmt
- src/core/indheap.c
- src/core/indheap.h
- src/core/interruption.c
- src/core/interruption.h
- src/core/marked_queue.c
- src/core/marked_queue.h
- src/core/math.h
- src/core/matrix.c
- src/core/matrix.pmt
- src/core/matrix_list.c
- src/core/memory.c
- src/core/printing.c
- src/core/progress.c
- src/core/psumtree.c
- src/core/set.c
- src/core/set.h
- + src/core/setup.c
- src/core/sparsemat.c
- src/core/stack.c
- src/core/stack.pmt
- src/core/statusbar.c
- src/core/strvector.c
- src/core/trie.c
- src/core/trie.h
- src/core/typed_list.pmt
- src/core/vector.c
- src/core/vector.pmt
- src/core/vector_list.c
- src/core/vector_ptr.c
- src/misc/cycle_bases.c → src/cycles/cycle_bases.c
- src/misc/feedback_arc_set.c → src/cycles/feedback_sets.c
- src/misc/feedback_arc_set.h → src/cycles/feedback_sets.h
- src/misc/order_cycle.cpp → src/cycles/order_cycle.cpp
- src/misc/order_cycle.h → src/cycles/order_cycle.h
- src/cycles/simple_cycles.c
- src/flow/flow.c
- src/flow/flow_conversion.c
- src/flow/flow_internal.h
- src/flow/st-cuts.c
- src/games/barabasi.c
- src/games/callaway_traits.c
- src/games/chung_lu.c
- src/games/citations.c
- src/games/correlated.c
- src/games/degree_sequence.c
- src/games/degree_sequence_vl/degree_sequence_vl.h
- src/games/degree_sequence_vl/gengraph_definitions.h
- src/games/degree_sequence_vl/gengraph_degree_sequence.cpp
- src/games/degree_sequence_vl/gengraph_degree_sequence.h
- src/games/degree_sequence_vl/gengraph_graph_molloy_hash.cpp
- src/games/degree_sequence_vl/gengraph_graph_molloy_hash.h
- src/games/degree_sequence_vl/gengraph_graph_molloy_optimized.cpp
- src/games/degree_sequence_vl/gengraph_graph_molloy_optimized.h
- src/games/degree_sequence_vl/gengraph_hash.h
- src/games/degree_sequence_vl/gengraph_mr-connected.cpp
- src/games/degree_sequence_vl/gengraph_qsort.h
- src/games/dotproduct.c
- src/games/erdos_renyi.c
- src/games/establishment.c
- src/games/forestfire.c
- src/games/grg.c
- src/games/growing_random.c
- src/games/islands.c
- src/games/k_regular.c
- src/games/preference.c
- src/games/recent_degree.c
- src/games/sbm.c
- src/games/static_fitness.c
- src/games/tree.c
- src/games/watts_strogatz.c
- src/graph/adjlist.c
- src/graph/attributes.c
- src/graph/attributes.h
- src/graph/basic_query.c
- src/graph/caching.c
- src/graph/caching.h
- src/graph/cattributes.c
- src/graph/graph_list.c
- src/graph/internal.h
- src/graph/iterators.c
- src/graph/type_common.c
- src/graph/type_indexededgelist.c
- src/graph/visitors.c
- src/hrg/dendro.h
- src/hrg/graph.h
- src/hrg/graph_simp.h
- src/hrg/hrg.cc
- src/hrg/hrg_types.cc
- src/hrg/rbtree.h
- src/hrg/splittree_eq.h
- src/internal/glpk_support.c
- src/internal/glpk_support.h
- src/internal/gmp_internal.h
- src/internal/hacks.c
- src/internal/hacks.h
- src/internal/lsap.c
- src/internal/utils.c
- src/internal/utils.h
- − src/internal/zeroin.c
- src/io/dimacs.c
- src/io/dl-header.h
- src/io/dl.c
- src/io/dot.c
- src/io/edgelist.c
- src/io/gml-header.h
- src/io/gml-tree.c
- src/io/gml-tree.h
- src/io/gml.c
- src/io/graphdb.c
- src/io/graphml.c
- src/io/leda.c
- src/io/lgl-header.h
- src/io/lgl.c
- src/io/ncol-header.h
- src/io/ncol.c
- src/io/pajek-header.h
- src/io/pajek.c
- src/io/parse_utils.c
- src/io/parse_utils.h
- src/io/parsers/dl-lexer.c
- src/io/parsers/dl-parser.c
- src/io/parsers/dl-parser.h
- src/io/parsers/gml-lexer.c
- src/io/parsers/gml-parser.c
- src/io/parsers/lgl-lexer.c
- src/io/parsers/lgl-parser.c
- src/io/parsers/lgl-parser.h
- src/io/parsers/ncol-lexer.c
- src/io/parsers/ncol-parser.c
- src/io/parsers/ncol-parser.h
- src/io/parsers/pajek-lexer.c
- src/io/parsers/pajek-parser.c
- src/io/parsers/pajek-parser.h
- src/isomorphism/bliss.cc
- src/isomorphism/isoclasses.c
- src/isomorphism/isoclasses.h
- src/isomorphism/isomorphism_misc.c
- src/isomorphism/lad.c
- src/isomorphism/queries.c
- src/isomorphism/vf2.c
- + src/layout/align.c
- src/layout/circular.c
- src/layout/davidson_harel.c
- src/layout/drl/drl_Node.h
- src/layout/drl/drl_Node_3d.h
- src/layout/drl/drl_graph.cpp
- src/layout/drl/drl_graph.h
- src/layout/drl/drl_graph_3d.cpp
- src/layout/drl/drl_graph_3d.h
- src/layout/drl/drl_layout.cpp
- src/layout/drl/drl_layout_3d.cpp
- src/layout/fruchterman_reingold.c
- src/layout/gem.c
- src/layout/graphopt.c
- src/layout/kamada_kawai.c
- src/layout/large_graph.c
- src/layout/layout_bipartite.c
- src/layout/layout_grid.c
- src/layout/layout_internal.h
- src/layout/layout_random.c
- src/layout/mds.c
- src/layout/merge_dla.c
- src/layout/merge_grid.c
- src/layout/merge_grid.h
- src/layout/reingold_tilford.c
- src/layout/sugiyama.c
- src/layout/umap.c
- src/linalg/arpack.c
- src/linalg/arpack_internal.h
- src/linalg/blas.c
- src/linalg/blas_internal.h
- src/linalg/eigen.c
- src/linalg/lapack.c
- src/linalg/lapack_internal.h
- src/math/complex.c
- src/math/safe_intop.c
- src/math/safe_intop.h
- src/math/utils.c
- src/misc/bipartite.c
- src/misc/chordality.c
- src/misc/cocitation.c
- src/misc/coloring.c
- src/misc/conversion.c
- src/misc/degree_sequence.cpp
- src/misc/embedding.c
- src/misc/graphicality.c
- src/community/infomap/infomap_Node.h → src/misc/graphicality.h
- src/misc/matching.c
- − src/misc/microscopic_update.c
- src/misc/mixing.c
- src/misc/motifs.c
- src/misc/other.c
- src/misc/power_law_fit.c
- src/misc/scan.c
- src/misc/sir.c
- src/misc/spanning_trees.c
- src/operators/add_edge.c
- src/operators/complementer.c
- src/operators/compose.c
- src/operators/connect_neighborhood.c
- src/operators/contract.c
- src/operators/difference.c
- src/operators/disjoint_union.c
- src/operators/intersection.c
- src/operators/join.c
- src/operators/misc_internal.c
- src/operators/misc_internal.h
- src/operators/permute.c
- src/operators/products.c
- src/operators/reverse.c
- src/operators/rewire.c
- src/operators/rewire_edges.c
- src/operators/rewire_internal.h
- src/operators/simplify.c
- src/operators/subgraph.c
- src/operators/subgraph.h
- src/operators/union.c
- src/paths/all_shortest_paths.c
- src/paths/astar.c
- src/paths/bellman_ford.c
- src/paths/dijkstra.c
- src/paths/distances.c
- src/paths/eulerian.c
- src/paths/floyd_warshall.c
- src/paths/histogram.c
- src/paths/johnson.c
- + src/paths/paths_internal.h
- src/paths/random_walk.c
- src/paths/shortest_paths.c
- src/paths/simple_paths.c
- src/paths/sparsifier.c
- src/paths/unweighted.c
- src/paths/voronoi.c
- src/paths/widest_paths.c
- src/properties/basic_properties.c
- src/properties/complete.c
- src/properties/constraint.c
- src/properties/convergence_degree.c
- src/properties/dag.c
- src/properties/degrees.c
- src/properties/ecc.c
- src/properties/girth.c
- src/properties/loops.c
- src/properties/multiplicity.c
- src/properties/neighborhood.c
- src/properties/perfect.c
- src/properties/properties_internal.h
- + src/properties/rich_club.c
- src/properties/spectral.c
- src/properties/trees.c
- src/properties/triangles.c
- src/properties/triangles_template.h
- src/properties/triangles_template1.h
- src/random/random.c
- + src/random/random_device.cpp
- src/random/random_internal.h
- src/random/rng_glibc2.c
- src/random/rng_mt19937.c
- src/random/rng_pcg32.c
- src/random/rng_pcg64.c
- + src/random/sampling.c
- + src/spatial/beta_skeleton.cpp
- + src/spatial/convex_hull.c
- + src/spatial/delaunay.c
- + src/spatial/edge_lengths.c
- + src/spatial/nanoflann_internal.hpp
- + src/spatial/nearest_neighbor.cpp
- include/igraph_array.h → src/spatial/spatial_internal.h
- src/version.c
- tests/CMakeLists.txt
- tests/benchmarks/bench.h
- + tests/benchmarks/beta_skeletons.c
- tests/benchmarks/igraph_coloring.c → tests/benchmarks/coloring.c
- tests/benchmarks/community.c
- tests/benchmarks/connectivity.c
- tests/benchmarks/erdos_renyi.c
- tests/benchmarks/graphicality.c
- + tests/benchmarks/igraph_adjacency.c
- tests/benchmarks/igraph_average_path_length_unweighted.c
- tests/benchmarks/igraph_betweenness.c
- tests/benchmarks/igraph_betweenness_weighted.c
- tests/benchmarks/igraph_cliques.c
- tests/benchmarks/igraph_closeness_weighted.c
- tests/benchmarks/igraph_decompose.c
- tests/benchmarks/igraph_degree.c
- tests/benchmarks/igraph_degree_sequence_game.c
- + tests/benchmarks/igraph_delaunay_graph.c
- tests/benchmarks/igraph_distances.c
- tests/benchmarks/igraph_ecc.c
- tests/benchmarks/igraph_induced_subgraph.c
- tests/benchmarks/igraph_induced_subgraph_edges.c
- tests/benchmarks/igraph_layout_umap.c
- tests/benchmarks/igraph_matrix_transpose.c
- tests/benchmarks/igraph_maximal_cliques.c
- + tests/benchmarks/igraph_nearest_neighbor_graph.c
- tests/benchmarks/igraph_neighborhood.c
- tests/benchmarks/igraph_pagerank.c
- tests/benchmarks/igraph_pagerank_weighted.c
- tests/benchmarks/igraph_power_law_fit.c
- tests/benchmarks/igraph_qsort.c
- tests/benchmarks/igraph_random_walk.c
- + tests/benchmarks/igraph_realize_degree_sequence.c
- + tests/benchmarks/igraph_rewire.c
- tests/benchmarks/igraph_strength.c
- tests/benchmarks/igraph_transitivity.c
- tests/benchmarks/igraph_tree_game.c
- tests/benchmarks/igraph_vertex_connectivity.c
- tests/benchmarks/igraph_voronoi.c
- tests/benchmarks/inc_vs_adj.c
- tests/benchmarks/intersection.c
- tests/benchmarks/lad.c
- tests/benchmarks/modularity.c
- + tests/benchmarks/spanning_tree.c
- tests/regression/bug-1033045.c
- tests/regression/bug-1149658.c
- tests/regression/bug_1760.c
- tests/regression/bug_1814.c
- tests/regression/bug_1970.c
- tests/regression/bug_2150.c
- tests/regression/bug_2497.c
- tests/regression/bug_2506.c
- tests/regression/bug_2517.c
- src/core/array.c → tests/regression/bug_2608.c
- + tests/regression/bug_2608.out
- tests/regression/cattr_bool_bug.c
- tests/regression/cattr_bool_bug2.c
- tests/regression/igraph_layout_kamada_kawai_3d_bug_1462.c
- tests/regression/igraph_layout_reingold_tilford_bug_879.c
- tests/regression/igraph_read_graph_gml_invalid_inputs.c
- tests/regression/igraph_read_graph_graphml_invalid_inputs.c
- tests/regression/igraph_read_graph_pajek_invalid_inputs.c
- tests/unit/2wheap.c
- tests/unit/VF2-compat.c
- tests/unit/adj.c
- tests/unit/adj.out
- tests/unit/adjlist.c
- tests/unit/all_almost_e.c
- tests/unit/all_shortest_paths.c
- tests/unit/assortativity.c
- + tests/unit/beta_skeletons.c
- + tests/unit/beta_skeletons.out
- tests/unit/bfs.c
- tests/unit/bfs_simple.c
- tests/unit/bitset.c
- tests/unit/bliss_automorphisms.c
- tests/unit/cattributes5.c
- tests/unit/cattributes6.c
- tests/unit/cattributes6.out
- tests/unit/centralization.c
- tests/unit/cmp_epsilon.c
- tests/unit/igraph_coloring.c → tests/unit/coloring.c
- tests/unit/community_indexing.c
- tests/unit/community_label_propagation.c
- tests/unit/community_label_propagation2.c
- tests/unit/community_label_propagation2.out
- tests/unit/community_label_propagation3.c
- tests/unit/community_leiden.c
- tests/unit/community_leiden.out
- tests/unit/community_walktrap.c
- tests/unit/components.c
- tests/unit/constructor-failure.c
- tests/unit/coreness.c
- tests/unit/cutheap.c
- tests/unit/cycle_bases.c
- tests/unit/d_indheap.c
- tests/unit/dgemv.c
- tests/unit/edge_selectors.c
- tests/unit/efficiency.c
- + tests/unit/eigen_stress.c
- tests/unit/erdos_renyi_game_gnm.c
- tests/unit/erdos_renyi_game_gnp.c
- tests/unit/error_macros.c
- tests/unit/expand_path_to_pairs.c
- tests/unit/fatal_handler.c
- tests/unit/foreign_empty.c
- tests/unit/full.c
- tests/unit/gen2wheap.c
- tests/unit/global_transitivity.c
- tests/unit/glpk_error.c
- tests/unit/gml.c
- tests/unit/graphlets.c
- tests/unit/harmonic_centrality.c
- tests/unit/heap.c
- tests/unit/hub_and_authority.c
- tests/unit/hub_and_authority.out
- tests/unit/igraph_add_edges.c
- tests/unit/igraph_add_vertices.c
- tests/unit/igraph_adhesion.c
- tests/unit/igraph_adjacency.c
- tests/unit/igraph_adjacency.out
- tests/unit/igraph_adjacency_spectral_embedding.c
- tests/unit/igraph_adjlist_init_complementer.c
- tests/unit/igraph_adjlist_init_complementer.out
- tests/unit/igraph_adjlist_simplify.c
- tests/unit/igraph_all_st_cuts.c
- tests/unit/igraph_all_st_mincuts.c
- tests/unit/igraph_almost_equals.c
- tests/unit/igraph_are_connected.c → tests/unit/igraph_are_adjacent.c
- tests/unit/igraph_arpack_rnsolve.c
- tests/unit/igraph_arpack_unpack_complex.c
- tests/unit/igraph_atlas.c
- tests/unit/igraph_attribute_combination_remove.c
- tests/unit/igraph_average_path_length.c
- tests/unit/igraph_average_path_length_dijkstra.c
- tests/unit/igraph_barabasi_aging_game.c
- tests/unit/igraph_barabasi_game.c
- tests/unit/igraph_betweenness.c
- tests/unit/igraph_betweenness_subset.c
- tests/unit/igraph_biadjacency.c
- tests/unit/igraph_biadjacency.out
- tests/unit/igraph_biconnected_components.c
- tests/unit/igraph_bipartite_create.c
- tests/unit/igraph_bipartite_game.c
- tests/unit/igraph_bipartite_projection.c
- tests/unit/igraph_blas_dgemm.c
- tests/unit/igraph_callaway_traits_game.c
- tests/unit/igraph_chung_lu_game.c
- tests/unit/igraph_circulant.c
- tests/unit/igraph_cited_type_game.c
- tests/unit/igraph_citing_cited_type_game.c
- tests/unit/igraph_clique_size_hist.c
- tests/unit/igraph_closeness.c
- tests/unit/igraph_cohesion.c
- tests/unit/igraph_cohesive_blocks.c
- tests/unit/igraph_community_eb_get_merges.c
- tests/unit/igraph_community_edge_betweenness.c
- tests/unit/igraph_community_fastgreedy.c
- tests/unit/igraph_community_fluid_communities.c
- tests/unit/igraph_community_infomap.c
- tests/unit/igraph_community_infomap.out
- tests/unit/igraph_community_leading_eigenvector2.c
- + tests/unit/igraph_community_optimal_modularity.c
- tests/unit/igraph_community_voronoi.c
- tests/unit/igraph_compare_communities.c
- tests/unit/igraph_complex.c
- tests/unit/igraph_connect_neighborhood.c
- tests/unit/igraph_constraint.c
- tests/unit/igraph_contract_vertices.c
- tests/unit/igraph_convergence_degree.c
- tests/unit/igraph_convex_hull.c → tests/unit/igraph_convex_hull_2d.c
- tests/unit/igraph_convex_hull.out → tests/unit/igraph_convex_hull_2d.out
- tests/unit/igraph_correlated_game.c
- tests/unit/igraph_correlated_pair_game.c
- tests/unit/igraph_count_adjacent_triangles.c
- tests/unit/igraph_create.c
- tests/unit/igraph_decompose_strong.c
- tests/unit/igraph_degree.c
- tests/unit/igraph_degree.out
- tests/unit/igraph_degree_sequence_game.c
- + tests/unit/igraph_delaunay_graph.c
- + tests/unit/igraph_delaunay_graph.out
- tests/unit/igraph_delete_edges.c
- tests/unit/igraph_delete_vertices.c
- tests/unit/igraph_density.c
- tests/unit/igraph_diameter.c
- tests/unit/igraph_diameter_dijkstra.c
- tests/unit/igraph_disjoint_union.c
- tests/unit/igraph_distances_floyd_warshall.c
- tests/unit/igraph_distances_floyd_warshall_speedup.c
- tests/unit/igraph_distances_johnson.c
- tests/unit/igraph_distances_johnson.out
- tests/unit/igraph_diversity.c
- tests/unit/igraph_dominator_tree.c
- tests/unit/igraph_dot_product_game.c
- tests/unit/igraph_dyad_census.c
- tests/unit/igraph_ecc.c
- tests/unit/igraph_ecc.out
- tests/unit/igraph_eccentricity.c
- tests/unit/igraph_eccentricity_dijkstra.c
- tests/unit/igraph_edge_betweenness.c
- tests/unit/igraph_edge_betweenness.out
- tests/unit/igraph_edge_betweenness_subset.c
- tests/unit/igraph_edge_disjoint_paths.c
- tests/unit/igraph_edges.c
- tests/unit/igraph_edges.out
- tests/unit/igraph_eigen_matrix.c
- tests/unit/igraph_eigen_matrix2.c
- tests/unit/igraph_eigen_matrix3.c
- tests/unit/igraph_eigen_matrix4.c
- tests/unit/igraph_eigen_matrix_symmetric.c
- tests/unit/igraph_eigen_matrix_symmetric_arpack.c
- tests/unit/igraph_eigenvector_centrality.c
- tests/unit/igraph_eigenvector_centrality.out
- tests/unit/igraph_empty.c
- tests/unit/igraph_es_all_between.c
- tests/unit/igraph_es_path.c
- tests/unit/igraph_establishment_game.c
- tests/unit/igraph_extended_chordal_ring.c
- tests/unit/igraph_feedback_arc_set.c
- tests/unit/igraph_feedback_vertex_set.c
- tests/unit/igraph_forest_fire_game.c
- tests/unit/igraph_from_prufer.c
- + tests/unit/igraph_full_bipartite.c
- + tests/unit/igraph_full_bipartite.out
- tests/unit/igraph_full_citation.c
- tests/unit/igraph_full_multipartite.c
- tests/unit/igraph_generalized_petersen.c
- tests/unit/igraph_get_adjacency.c
- tests/unit/igraph_get_adjacency_sparse.c
- tests/unit/igraph_get_all_shortest_paths_dijkstra.c
- tests/unit/igraph_get_all_simple_paths.c
- tests/unit/igraph_get_all_simple_paths.out
- tests/unit/igraph_get_biadjacency.c
- tests/unit/igraph_get_eid.c
- tests/unit/igraph_get_isomorphisms_vf2.c
- tests/unit/igraph_get_isomorphisms_vf2.out
- tests/unit/igraph_get_k_shortest_paths.c
- tests/unit/igraph_get_laplacian.c
- tests/unit/igraph_get_shortest_path_astar.c
- tests/unit/igraph_get_shortest_path_bellman_ford.c
- tests/unit/igraph_get_shortest_paths2.c
- tests/unit/igraph_get_shortest_paths_bellman_ford.c
- tests/unit/igraph_get_shortest_paths_dijkstra.c
- tests/unit/igraph_get_stochastic.c
- tests/unit/igraph_get_stochastic_sparse.c
- tests/unit/igraph_get_subisomorphisms_vf2.c
- tests/unit/igraph_gomory_hu_tree.c
- tests/unit/igraph_graph_center.c
- tests/unit/igraph_graph_center.out
- tests/unit/igraph_graph_power.c
- tests/unit/igraph_grg_game.c
- tests/unit/igraph_growing_random_game.c
- tests/unit/igraph_has_mutual.c
- tests/unit/igraph_hexagonal_lattice.c
- tests/unit/igraph_hrg.c
- tests/unit/igraph_hrg2.c
- tests/unit/igraph_hrg3.c
- tests/unit/igraph_hrg_create.c
- tests/unit/igraph_hsbm_game.c
- tests/unit/igraph_hsbm_list_game.c
- tests/unit/igraph_i_layout_sphere.c
- − tests/unit/igraph_i_neighbors.c
- tests/unit/igraph_i_umap_fit_ab.c
- tests/unit/igraph_i_incident.c → tests/unit/igraph_incident.c
- tests/unit/igraph_i_incident.out → tests/unit/igraph_incident.out
- tests/unit/igraph_induced_subgraph.c
- tests/unit/igraph_induced_subgraph_edges.c
- tests/unit/igraph_induced_subgraph_map.c
- tests/unit/igraph_induced_subgraph_map.out
- tests/unit/igraph_intersection.c
- tests/unit/igraph_is_acyclic.c
- tests/unit/igraph_is_biconnected.c
- tests/unit/igraph_is_chordal.c
- tests/unit/igraph_is_clique.c
- tests/unit/igraph_is_complete.c
- tests/unit/igraph_is_connected.c
- tests/unit/igraph_is_dag.c
- tests/unit/igraph_is_forest.c
- tests/unit/igraph_is_forest2.c
- tests/unit/igraph_is_mutual.c
- tests/unit/igraph_is_same_graph.c
- tests/unit/igraph_is_separator.c
- tests/unit/igraph_is_tree.c
- tests/unit/igraph_isomorphic.c
- tests/unit/igraph_isomorphic_bliss.c
- tests/unit/igraph_isomorphic_vf2.c
- tests/unit/igraph_join.c
- tests/unit/igraph_joint_degree_distribution.c
- tests/unit/igraph_joint_type_distribution.c
- tests/unit/igraph_k_regular_game.c
- tests/unit/igraph_kautz.c
- tests/unit/igraph_lapack_dgeev.c
- tests/unit/igraph_lapack_dgeevx.c
- tests/unit/igraph_lapack_dgehrd.c
- tests/unit/igraph_lapack_dgetrf.c
- tests/unit/igraph_lapack_dgetrs.c
- tests/unit/igraph_lapack_dsyevr.c
- tests/unit/igraph_lastcit_game.c
- + tests/unit/igraph_layout_align.c
- tests/unit/igraph_layout_bipartite.c
- tests/unit/igraph_layout_davidson_harel.c
- tests/unit/igraph_layout_drl.c
- tests/unit/igraph_layout_drl_3d.c
- tests/unit/igraph_layout_fruchterman_reingold.c
- tests/unit/igraph_layout_fruchterman_reingold_3d.c
- tests/unit/igraph_layout_gem.c
- tests/unit/igraph_layout_graphopt.c
- tests/unit/igraph_layout_grid.c
- tests/unit/igraph_layout_kamada_kawai.c
- tests/unit/igraph_layout_kamada_kawai.out
- tests/unit/igraph_layout_lgl.c
- tests/unit/igraph_layout_mds.c
- tests/unit/igraph_layout_merge.c
- tests/unit/igraph_layout_merge2.c
- tests/unit/igraph_layout_merge3.c
- tests/unit/igraph_layout_random_3d.c
- − tests/unit/igraph_layout_random_3d.out
- tests/unit/igraph_layout_reingold_tilford_circular.c
- tests/unit/igraph_layout_reingold_tilford_extended.c
- tests/unit/igraph_layout_sphere.c
- tests/unit/igraph_layout_star.c
- tests/unit/igraph_layout_sugiyama.c
- tests/unit/igraph_layout_sugiyama.out
- tests/unit/igraph_layout_umap.c
- tests/unit/igraph_sparsemat_view.c → tests/unit/igraph_lcf.c
- tests/unit/igraph_le_community_to_membership.c
- tests/unit/igraph_linegraph.c
- tests/unit/igraph_list_triangles.c
- tests/unit/igraph_local_scan_k_ecount.c
- tests/unit/igraph_local_scan_k_ecount_them.c
- tests/unit/igraph_local_scan_subset_ecount.c
- tests/unit/igraph_local_transitivity.c
- tests/unit/igraph_maxflow.c
- tests/unit/igraph_maximal_cliques.c
- tests/unit/igraph_maximal_cliques2.c
- tests/unit/igraph_maximal_cliques3.c
- tests/unit/igraph_maximal_cliques4.c
- tests/unit/igraph_maximal_cliques_file.c
- tests/unit/igraph_maximum_bipartite_matching.c
- tests/unit/igraph_mean_degree.c
- tests/unit/igraph_minimum_size_separators.c
- tests/unit/igraph_minimum_size_separators.out
- tests/unit/igraph_modularity.c
- tests/unit/igraph_modularity_matrix.c
- tests/unit/igraph_motifs_randesu.c
- tests/unit/igraph_motifs_randesu_estimate.c
- tests/unit/igraph_motifs_randesu_no.c
- + tests/unit/igraph_nearest_neighbor_graph.c
- + tests/unit/igraph_nearest_neighbor_graph.out
- tests/unit/igraph_neighborhood.c
- tests/unit/igraph_neighborhood_graphs.c
- tests/unit/igraph_neighborhood_size.c
- tests/unit/igraph_neighbors.c
- tests/unit/igraph_i_neighbors.out → tests/unit/igraph_neighbors.out
- tests/unit/igraph_pagerank.c
- tests/unit/igraph_path_length_hist.c
- tests/unit/igraph_perfect.c
- tests/unit/igraph_permute_vertices.c
- tests/unit/igraph_power_law_fit.c
- tests/unit/igraph_preference_game.c
- tests/unit/igraph_product.c
- tests/unit/igraph_progress_handler_stderr.c
- tests/unit/igraph_pseudo_diameter.c
- tests/unit/igraph_pseudo_diameter_dijkstra.c
- tests/unit/igraph_psumtree.c
- tests/unit/igraph_qsort.c
- tests/unit/igraph_qsort_r.c
- tests/unit/igraph_random_sample.c
- tests/unit/igraph_random_walk.c
- tests/unit/igraph_read_graph_graphdb.c
- tests/unit/igraph_read_graph_graphml.c
- tests/unit/igraph_realize_bipartite_degree_sequence.c
- tests/unit/igraph_realize_degree_sequence.out
- tests/unit/igraph_recent_degree_aging_game.c
- tests/unit/igraph_recent_degree_game.c
- + tests/unit/igraph_reindex_membership.c
- tests/unit/igraph_residual_graph.c
- tests/unit/igraph_reverse_edges.c
- tests/unit/igraph_rewire.c
- tests/unit/igraph_rewire_directed_edges.c
- tests/unit/igraph_rng_get_integer.c
- tests/unit/igraph_sample_dirichlet.c → tests/unit/igraph_rng_sample_dirichlet.c
- tests/unit/igraph_sample_dirichlet.out → tests/unit/igraph_rng_sample_dirichlet.out
- tests/unit/igraph_sample_sphere.c → tests/unit/igraph_rng_sample_sphere.c
- + tests/unit/igraph_rooted_product.c
- tests/unit/igraph_running_mean.c
- tests/unit/igraph_sbm_game.c
- tests/unit/igraph_sbm_game.out
- tests/unit/igraph_set_progress_handler.c
- tests/unit/igraph_similarity.c
- tests/unit/igraph_similarity.out
- tests/unit/igraph_simple_cycles.c
- tests/unit/igraph_simple_interconnected_islands_game.c
- tests/unit/igraph_sir.c
- tests/unit/igraph_solve_lsap.c
- tests/unit/igraph_spanner.c
- tests/unit/igraph_sparsemat2.c
- tests/unit/igraph_sparsemat5.c
- tests/unit/igraph_sparsemat9.c
- tests/unit/igraph_sparsemat_droptol.c
- tests/unit/igraph_sparsemat_fkeep.c
- tests/unit/igraph_sparsemat_getelements_sorted.c
- tests/unit/igraph_sparsemat_is_symmetric.c
- tests/unit/igraph_sparsemat_iterator_idx.c
- tests/unit/igraph_sparsemat_minmax.c
- tests/unit/igraph_sparsemat_nonzero_storage.c
- tests/unit/igraph_sparsemat_normalize.c
- tests/unit/igraph_sparsemat_which_minmax.c
- + tests/unit/igraph_spatial_edge_lengths.c
- + tests/unit/igraph_spatial_edge_lengths.out
- tests/unit/igraph_split_join_distance.c
- tests/unit/igraph_split_join_distance.out
- tests/unit/igraph_square_lattice.c
- tests/unit/igraph_st_edge_connectivity.c
- tests/unit/igraph_st_mincut.c
- tests/unit/igraph_st_mincut_value.c
- tests/unit/igraph_st_vertex_connectivity.c
- tests/unit/igraph_static_power_law_game.c
- tests/unit/igraph_strvector.c
- tests/unit/igraph_strvector.out
- tests/unit/igraph_subcomponent.c
- tests/unit/igraph_subisomorphic.c
- tests/unit/igraph_subisomorphic_lad.c
- tests/unit/igraph_to_prufer.c
- tests/unit/igraph_transitive_closure.c
- tests/unit/igraph_transitivity_avglocal_undirected.c
- tests/unit/igraph_transitivity_barrat.c
- tests/unit/igraph_triangular_lattice.c
- tests/unit/igraph_trussness.c
- tests/unit/igraph_turan.c
- tests/unit/igraph_unfold_tree.c
- tests/unit/igraph_union.c
- tests/unit/igraph_vector_floor.c
- tests/unit/igraph_vector_lex_cmp.c
- tests/unit/igraph_vertex_disjoint_paths.c
- tests/unit/igraph_voronoi.c
- tests/unit/igraph_weighted_adjacency.c
- tests/unit/igraph_weighted_adjacency.out
- + tests/unit/igraph_weighted_biadjacency.c
- + tests/unit/igraph_weighted_biadjacency.out
- tests/unit/igraph_weighted_cliques.c
- tests/unit/igraph_wheel.c
- tests/unit/igraph_write_graph_dimacs_flow.c
- tests/unit/igraph_write_graph_dot.c
- tests/unit/igraph_write_graph_leda.c
- tests/unit/inclist.c
- + tests/unit/is_coloring.c
- tests/unit/isoclasses.c
- tests/unit/isoclasses2.c
- tests/unit/isomorphism_test.c
- tests/unit/jdm.c
- tests/unit/kary_tree.c
- tests/unit/knn.c
- tests/unit/levc-stress.c
- tests/unit/lineendings.c
- tests/unit/marked_queue.c
- tests/unit/matrix.c
- tests/unit/matrix2.c
- tests/unit/matrix3.c
- tests/unit/matrix_complex.c
- + tests/unit/max_results.c
- tests/unit/maximal_cliques_callback.c
- tests/unit/maximal_cliques_hist.c
- + tests/unit/minimum_spanning_tree.c
- + tests/unit/minimum_spanning_tree.out
- + tests/unit/mycielskian.c
- + tests/unit/mycielskian.out
- tests/unit/ncol.c
- tests/unit/null_communities.c
- tests/unit/overflow.c
- tests/unit/pajek.c
- tests/unit/pajek2.c
- tests/unit/pajek_bipartite.c
- tests/unit/pajek_bipartite2.c
- tests/unit/pajek_bipartite2.out
- tests/unit/pajek_signed.c
- tests/unit/pajek_signed.out
- tests/unit/paths.c
- + tests/unit/percolation.c
- + tests/unit/percolation.out
- tests/unit/prop_caching.c
- tests/unit/random_sampling.c
- tests/unit/random_spanning_tree.c
- tests/unit/reachability.c
- + tests/unit/rich_club.c
- + tests/unit/rich_club.out
- tests/unit/ring.c
- tests/unit/rng_init_destroy_max_bits_name_set_default.c
- tests/unit/rng_reproducibility.c
- tests/unit/set.c
- tests/unit/simplify_and_colorize.c
- tests/unit/single_target_shortest_path.c
- tests/unit/spinglass.c
- tests/unit/stack.c
- tests/unit/strvector_set_len_remove_print.c
- tests/unit/symmetric_tree.c
- tests/unit/test_utilities.c
- tests/unit/test_utilities.h
- tests/unit/tls1.c
- tests/unit/tls2.c
- tests/unit/topological_sorting.c
- tests/unit/tree_game.c
- tests/unit/triad_census.c
- tests/unit/trie.c
- tests/unit/vector.c
- tests/unit/vector.out
- tests/unit/vector2.c
- tests/unit/vector2.out
- tests/unit/vector3.c
- tests/unit/vector4.c
- tests/unit/vector_list.c
- tests/unit/vector_ptr.c
- tests/unit/vector_ptr_sort_ind.c
- tests/unit/vector_sort_ind.c
- tests/unit/vertex_selectors.c
- tests/unit/watts_strogatz_game.c
- tests/unit/igraph_widest_paths.c → tests/unit/widest_paths.c
- tests/unit/igraph_widest_paths.out → tests/unit/widest_paths.out
- tests/unit/zapsmall.c
- tests/unit/zero_allocs.c
- vendor/CMakeLists.txt
- vendor/cs/cs.h
- vendor/cs/cs_randperm.c
- + vendor/infomap/CITATION.cff
- + vendor/infomap/CMakeLists.txt
- + vendor/infomap/LICENSE_GPLv3.txt
- + vendor/infomap/README.rst
- + vendor/infomap/src/Infomap.h
- + vendor/infomap/src/core/BiasedMapEquation.cpp
- + vendor/infomap/src/core/BiasedMapEquation.h
- + vendor/infomap/src/core/FlowData.h
- + vendor/infomap/src/core/InfoEdge.cpp
- + vendor/infomap/src/core/InfoEdge.h
- + vendor/infomap/src/core/InfoNode.cpp
- + vendor/infomap/src/core/InfoNode.h
- + vendor/infomap/src/core/InfomapBase.cpp
- + vendor/infomap/src/core/InfomapBase.h
- + vendor/infomap/src/core/InfomapConfig.h
- + vendor/infomap/src/core/InfomapOptimizer.h
- + vendor/infomap/src/core/InfomapOptimizerBase.h
- + vendor/infomap/src/core/MapEquation.h
- + vendor/infomap/src/core/MemMapEquation.cpp
- + vendor/infomap/src/core/MemMapEquation.h
- + vendor/infomap/src/core/MetaMapEquation.cpp
- + vendor/infomap/src/core/MetaMapEquation.h
- + vendor/infomap/src/core/StateNetwork.cpp
- + vendor/infomap/src/core/StateNetwork.h
- + vendor/infomap/src/core/iterators/InfomapIterator.cpp
- + vendor/infomap/src/core/iterators/InfomapIterator.h
- + vendor/infomap/src/core/iterators/IterWrapper.h
- + vendor/infomap/src/core/iterators/infomapIterators.h
- + vendor/infomap/src/core/iterators/treeIterators.h
- + vendor/infomap/src/io/ClusterMap.cpp
- + vendor/infomap/src/io/ClusterMap.h
- + vendor/infomap/src/io/Config.cpp
- + vendor/infomap/src/io/Config.h
- + vendor/infomap/src/io/Network.cpp
- + vendor/infomap/src/io/Network.h
- + vendor/infomap/src/io/Output.cpp
- + vendor/infomap/src/io/Output.h
- + vendor/infomap/src/io/ProgramInterface.cpp
- + vendor/infomap/src/io/ProgramInterface.h
- + vendor/infomap/src/io/SafeFile.h
- + vendor/infomap/src/utils/Date.h
- + vendor/infomap/src/utils/FileURI.cpp
- + vendor/infomap/src/utils/FileURI.h
- + vendor/infomap/src/utils/FlowCalculator.cpp
- + vendor/infomap/src/utils/FlowCalculator.h
- + vendor/infomap/src/utils/Log.cpp
- + vendor/infomap/src/utils/Log.h
- + vendor/infomap/src/utils/MetaCollection.h
- + vendor/infomap/src/utils/Random.h
- + vendor/infomap/src/utils/Stopwatch.h
- + vendor/infomap/src/utils/VectorMap.h
- + vendor/infomap/src/utils/convert.h
- + vendor/infomap/src/utils/infomath.h
- + vendor/infomap/src/version.h
- + vendor/nanoflann/nanoflann.hpp
- + vendor/qhull/CHANGES.md
- + vendor/qhull/CMakeLists.txt
- + vendor/qhull/COPYING.txt
- + vendor/qhull/README.txt
- + vendor/qhull/libqhull_r/accessors_r.c
- + vendor/qhull/libqhull_r/geom2_r.c
- + vendor/qhull/libqhull_r/geom_r.c
- + vendor/qhull/libqhull_r/geom_r.h
- + vendor/qhull/libqhull_r/global_r.c
- + vendor/qhull/libqhull_r/io_r.c
- + vendor/qhull/libqhull_r/io_r.h
- + vendor/qhull/libqhull_r/libqhull_r.c
- + vendor/qhull/libqhull_r/libqhull_r.h
- + vendor/qhull/libqhull_r/mem_r.c
- + vendor/qhull/libqhull_r/mem_r.h
- + vendor/qhull/libqhull_r/merge_r.c
- + vendor/qhull/libqhull_r/merge_r.h
- + vendor/qhull/libqhull_r/poly2_r.c
- + vendor/qhull/libqhull_r/poly_r.c
- + vendor/qhull/libqhull_r/poly_r.h
- + vendor/qhull/libqhull_r/qhull_ra.h
- + vendor/qhull/libqhull_r/qset_r.c
- + vendor/qhull/libqhull_r/qset_r.h
- + vendor/qhull/libqhull_r/random_r.c
- + vendor/qhull/libqhull_r/random_r.h
- + vendor/qhull/libqhull_r/rboxlib_r.c
- + vendor/qhull/libqhull_r/stat_r.c
- + vendor/qhull/libqhull_r/stat_r.h
- + vendor/qhull/libqhull_r/user_r.c
- + vendor/qhull/libqhull_r/user_r.h
- + vendor/qhull/libqhull_r/usermem_r.c
- + vendor/qhull/libqhull_r/userprintf_r.c
- + vendor/qhull/libqhull_r/userprintf_rbox_r.c


The diff was not included because it is too large.


View it on GitLab: https://salsa.debian.org/med-team/igraph/-/compare/442de9df7a6f149b97d1ef14f4b8d3e8e5fdecc4...611697190f128e8c0d37e405edacdf9658cd31c8

-- 
View it on GitLab: https://salsa.debian.org/med-team/igraph/-/compare/442de9df7a6f149b97d1ef14f4b8d3e8e5fdecc4...611697190f128e8c0d37e405edacdf9658cd31c8
You're receiving this email because of your account on salsa.debian.org.


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://alioth-lists.debian.net/pipermail/debian-med-commit/attachments/20251005/140a7784/attachment-0001.htm>