Software Open Access
igraph
Csárdi, Gábor;
Nepusz, Tamás;
Horvát, Szabolcs;
Traag, Vincent;
Zanini, Fabio;
Noom, Daniel
Added
igraph_get_shortest_path_astar()finds a shortest path with the A* algorithm.igraph_vertex_coloring_greedy()now supports the DSatur heuristics (#2284, thanks to @professorcode1).
- The
testbuild target now only runs the unit tests, but it does not build them. In order to both build and run tests, use thechecktarget, which continues to behave as before (PR #2291). - The experimental function
igraph_distances_floyd_warshall()now hasfromandtoparameters for choosing source and target vertices. - The experimental function
igraph_distances_floyd_warshall()now has an additionalmethodparameter to select a specific algorithm. A faster "Tree" variant of the Floyd-Warshall algorithm is now available (#2267, thanks to @rfulekjames).
- The Bellman-Ford shortest path finder is now interruptible.
- The Floyd-Warshall shortest path finder is now interruptible.
- Running CTest no longer builds the tests automatically, as this interfered with VSCode, which would invoke the
ctestexecutable after configuring a project in order to determine test executables. Use thebuild_teststarget to build the tests first, or use thechecktarget to both build and run all unit tests (PR #2291).
- Improved the performance and memory usage of
igraph_widest_path_widths_floyd_warshall(). - Documentation improvements.
Files
(5.1 MB)
| Name | Size | |
|---|---|---|
|
igraph/igraph-0.10.4.zip
md5:9d4699edf5d34430576ed8d6bf47de18 |
5.1 MB | Download |
1,336
36
views
downloads
| All versions | This version | |
|---|---|---|
| Views | 1,336 | 152 |
| Downloads | 36 | 4 |
| Data volume | 245.4 MB | 20.4 MB |
| Unique views | 1,160 | 134 |
| Unique downloads | 35 | 4 |
Available in
Indexed in
Indexed in
- Publication date:
- January 26, 2023
- DOI:
-
- Keyword(s):
- graph theory network analysis
- Related identifiers:
- Supplement to
- License (for files):
- Other (Open)