Software Open Access
Csárdi, Gábor;
Nepusz, Tamás;
Horvát, Szabolcs;
Traag, Vincent;
Zanini, Fabio;
Noom, Daniel
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).test
build target now only runs the unit tests, but it does not build them. In order to both build and run tests, use the check
target, which continues to behave as before (PR #2291).igraph_distances_floyd_warshall()
now has from
and to
parameters for choosing source and target vertices.igraph_distances_floyd_warshall()
now has an additional method
parameter to select a specific algorithm. A faster "Tree" variant of the Floyd-Warshall algorithm is now available (#2267, thanks to @rfulekjames).ctest
executable after configuring a project in order to determine test executables. Use the build_tests
target to build the tests first, or use the check
target to both build and run all unit tests (PR #2291).igraph_widest_path_widths_floyd_warshall()
.Name | Size | |
---|---|---|
igraph/igraph-0.10.4.zip
md5:9d4699edf5d34430576ed8d6bf47de18 |
5.1 MB | Download |
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 |