LightGraphs v1.3.0

LightGraphs v1.3.0.

Fixed:

• infinite cycle traversal in floyd-warshall (#1075)
• speed improvements in transitive closure (#1078)
• misc bugfixes and documentation fixes
• performance improvements to Tarjan (#1182)
• performance improvements to laplacian_matrix (#1191)
• performance improvements to Bellman-Ford shortest path algorithm (#1193)
• nested testsets (still in progress)
• performance improvements to edge iterators (#1202)
• performance improvements to A* shortest path algorithm (#1231)

New:

• karate graph generator (#1045)
• complete_multipartite_graph() and turan_graph() (#1031)
• ladder graphs (#1044)
• rem_vertices! (#1047)
• multiple documentation enhancements
• dominating set (#1039)
• maximum spanning tree (#1081)
• barbell and lollipop graph generators (#1084)
• bridges() (#1105)
• D'Esopo-Pape shortest path algorithm (#1160)
• Kosaraju's algorithm for strongly connected components (#1173)
• Shortest Path Faster algorithm (#1189)
• new shortest paths functions in Experimental/ShortestPaths (#1242)

Changed:

• modularity now considers directed/weighted graphs (#1066, #1068)
• iterative articulation for large graphs (#1111)