Releases
0.10.7
Compare
Sorry, something went wrong.
No results found
ntamas
released this
04 Sep 13:55
Added
igraph_radius_dijkstra() computes the graph radius with weighted edges (experimental function).
igraph_graph_center_dijkstra() computes the graph center, i.e. the set of minimum eccentricity vertices, with weighted edges (experimental function).
Fixed
igraph_full_bipartite() now checks for overflow.
igraph_bipartite_game_gnm() and igraph_bipartite_game_gnp() are now more robust to overflow.
Bipartite graph creation functions now check input arguments.
igraph_write_graph_dot() now quotes real numbers written in exponential notation as necessary.
Independent vertex set finding functions could trigger the fatal error "Finally stack too large" when called on large graphs.
Deprecated
igraph_bipartite_game() is now deprecated; use igraph_bipartite_game_gnm() and igraph_bipartite_game_gnp() instead.
Other
Documentation improvements.
You can’t perform that action at this time.