{"push_id":2084394661,"size":22,"distinct_size":18,"ref":"refs/heads/master","head":"4454b2b93126f6ed313f64320b35e318c8b406a7","before":"e3d91fe3446236da04bbb1741b5fa1f7e7e18a2e","commits":[{"sha":"7150a6bc2d8616605d9cc0acf51b7ef08481032c","author":{"name":"Dan Schult","email":"d65fd63286b00431bba9c9ccffeada8ee706b5d0@colgate.edu"},"message":"fix typo in mst.py. Fixes #2675","distinct":false,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/7150a6bc2d8616605d9cc0acf51b7ef08481032c"},{"sha":"f7acddf836ec53e1c7753ba820258d5d2dc07f9f","author":{"name":"Charles Tapley Hoyt","email":"8935490d3bed0bb627be075a5a2783abd15b49c7@gmail.com"},"message":"Fix typo in documentation (#2677)","distinct":false,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/f7acddf836ec53e1c7753ba820258d5d2dc07f9f"},{"sha":"5613e71e84907ea7914ee60ee66858c00475fb07","author":{"name":"Adam Erispaha","email":"ae47b6019a0f13a7428a450771367fac279efe97@gmail.com"},"message":"unpacked dict of to provide keyword arguments when creating nodes from shapefiles (#2678)","distinct":false,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/5613e71e84907ea7914ee60ee66858c00475fb07"},{"sha":"6bdf9810667bedd2712cb7ad73ebee34a8abb8bd","author":{"name":"Richard Penney","email":"6ba7e4ff0eebba5ef67d27ac54561c4014c91c05@users.noreply.github.com"},"message":"Added Kamada-Kawai functions to Sphinx documentation (#2680)","distinct":false,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/6bdf9810667bedd2712cb7ad73ebee34a8abb8bd"},{"sha":"c3b0761f96cb85d2c4d4b8c7bf6fe451c17fb961","author":{"name":"Jack Amadeo","email":"48e89c89f6dd10c49d197dace7cd76e410bf1c3b@gmail.com"},"message":"Improve subgraph node iteration (#2687)\n\nThe show_nodes() filter creates a set from an iterable container.\r\nHowever, FilterAtlas will always traverse the entire node set,\r\neven though the set of nodes is available in this newly constructed\r\nset.\r\n\r\nThis change dramatically speeds up node iteration when the subgraph\r\nis much smaller than the graph.","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/c3b0761f96cb85d2c4d4b8c7bf6fe451c17fb961"},{"sha":"86e81edd5dc3ea4f2b37e7b8fc4409a87625b58f","author":{"name":"James Lamb","email":"8904478a588a8cdc2c2f62dd4c3991b653621603@gmail.com"},"message":"Removed unused imports (#2653)","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/86e81edd5dc3ea4f2b37e7b8fc4409a87625b58f"},{"sha":"2357df70de3ba649a2a85943701047d54137b81e","author":{"name":"Daniel Bradburn","email":"4b94a04674ad2c69d990e94ab196ac3f8e9e03d4@crunchrapps.com"},"message":"Fixed a problem when reading graphml files where nodes that were part of groups would only be parsed if they were connected to non-grouped nodes via edges (#2644)","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/2357df70de3ba649a2a85943701047d54137b81e"},{"sha":"c01040c4f1f50bd036f76a0b26b30d0ad2130565","author":{"name":"Ioannis Filippidis","email":"5d8746a4309bbed4a2dd6b55aee5520ab796f88a@users.noreply.github.com"},"message":"API: rm argument `strict` from function `to_pydot` (#2672)\n\nThe keyword argument `strict` is unused, because the\r\nargument's value is ignored within the function.\r\nAlso, the docstring does not mention `strict`.","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/c01040c4f1f50bd036f76a0b26b30d0ad2130565"},{"sha":"1f096562532b5e14fce5f21162ad65b7c730715f","author":{"name":"Jon Crall","email":"867b0cc90b6665f2d85f4ea3a19d5f1b2236ca09@gmail.com"},"message":"Added function for finding a k-edge-augmentation (#2572)\n\n* Initial commit for edge_augmentation enhancement\r\n\r\n* Added is_k_edge_connected\r\n\r\n* getting tests to run without syntax errors\r\n\r\n* Added argmin to utils and updated weighted bridge aug to actually use weights\r\n\r\n* Found error in weighted bridges\r\n\r\n* Fixed serious bug in weighted bridge augmentation\r\n\r\n* module cleanup\r\n\r\n* more consise implementation of 1-edge-aug\r\n\r\n* removed alternative implementations of one edge aug\r\n\r\n* Fixed bugs in unconstrained bridge augmentation. Added tests for feasibility and optimality. Doctests and nosetests all pass\r\n\r\n* Removed debugging code\r\n\r\n* Actually removed debugging code\r\n\r\n* Reworked randomized algorithm into a real greedy algorithm based on weights\r\n\r\n* added better algorithm for finding a partial augmentation\r\n\r\n* fixed doc. Also rebased onto master\r\n\r\n* removed test code\r\n\r\n* Added whatsnew and documentation\r\n\r\n* used tiebreaker weights when avail is not given to greedy algo\r\n\r\n* comments\r\n\r\n* removed old param and passed partial to k=1\r\n\r\n* Fixed test failures on python2\r\n\r\n* test fixes for 3.6. removed old comment\r\n\r\n* debugging 3.6 failure\r\n\r\n* Using new LCA algorithm. Fixed subgraph errors. Attempt to make edge ordering more sane and aggreable with Khullers notation\r\n\r\n* minor line-break rearrangement for one exception message\r\n\r\n* Added and improved docs in edge_augmentation\r\n\r\n* quick fix for consistency\r\n\r\n* another minor fix\r\n\r\n* removed commented code:\r\n:","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/1f096562532b5e14fce5f21162ad65b7c730715f"},{"sha":"242ca83f1216080449be506cea7c9b14223b6d68","author":{"name":"Sanggyu Nam","email":"14b8f60576b136e1ed184fc82e3655d2b6223276@gmail.com"},"message":"Fix create_using of nx.from_pandas_adjacency() (#2693)\n\n* See #2689.","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/242ca83f1216080449be506cea7c9b14223b6d68"},{"sha":"81a036d81b47b082512193b67405d9a1b69fded4","author":{"name":"Jarrod Millman","email":"100d1f0f30c5787a4add2e478b9c3ff350969c8f@gmail.com"},"message":"Add example of spectral embedding of the grid graph (#2690)","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/81a036d81b47b082512193b67405d9a1b69fded4"},{"sha":"8130e9910e6d301fee004068b79d3def4bcd1033","author":{"name":"Viraj Parimi","email":"24c6a68740d9c741727ae6e617355426ddec9108@users.noreply.github.com"},"message":"Fixes bug #2503 by removing arrow labels (#2696)","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/8130e9910e6d301fee004068b79d3def4bcd1033"},{"sha":"aacd8fe5018df8c823d7a31003339c7aafb77a94","author":{"name":"Huston Hedinger","email":"e03ba929cd77d103f2bd2c02e902a2b263d2257b@gmail.com"},"message":"docs(centrality/dispersion): updating contributor email address (#2698)","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/aacd8fe5018df8c823d7a31003339c7aafb77a94"},{"sha":"d9ac487f47defd2f9716ac3678b26222c6ce7599","author":{"name":"Ioannis Filippidis","email":"5d8746a4309bbed4a2dd6b55aee5520ab796f88a@users.noreply.github.com"},"message":"mention `doc.txt` in `requirements/README.md` (#2699)\n\n* DOC: use Markdown\r\n\r\n* DOC: list `requirements/doc.txt` in the relevant README","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/d9ac487f47defd2f9716ac3678b26222c6ce7599"},{"sha":"9f6c9cd6a561d41192bc29f14fd9bc16bcaad919","author":{"name":"Dan Schult","email":"d65fd63286b00431bba9c9ccffeada8ee706b5d0@colgate.edu"},"message":"Update migration_guide_from_1.x_to_2.0.rst (#2694)\n\n* Update migration_guide_from_1.x_to_2.0.rst\r\n\r\ndegree.values info and pickle info\r\n\r\n* Fix doctests","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/9f6c9cd6a561d41192bc29f14fd9bc16bcaad919"},{"sha":"657f5794e8685153f3177279c1288e43f0642c11","author":{"name":"md0000","email":"997715cbe8e4496009cd2e90f9ce2ce3676441a8@users.noreply.github.com"},"message":"Fix for issue #2427 (#2712)\n\n* Fix for issue #2427\r\n\r\n* Improvement of fix for issue #2427\r\n\r\n* Add tests for issue #2427 fix\r\n\r\n* Fix for _bidirectional_{dijkstra, shortest_path}\r\n\r\nFix _bidirectional_dijkstra and _bidirectional_shortest_path to\r\nraise NetworkXNoPath when ignore_nodes includes source and/or\r\ntarget vertex. Also add tests for this possibility.","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/657f5794e8685153f3177279c1288e43f0642c11"},{"sha":"7b19f7059ead2c0d15dea77596e919f310f5f227","author":{"name":"md0000","email":"997715cbe8e4496009cd2e90f9ce2ce3676441a8@users.noreply.github.com"},"message":"Fix for inter_community_edges (#2713)\n\n* Fix inter_community_edges() to correctly handle digraphs (#2600)\r\n\r\n* Add digraph tests for inter_community_edges()","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/7b19f7059ead2c0d15dea77596e919f310f5f227"},{"sha":"00a43573126279f51bc397fad62849c2a3d26997","author":{"name":"Ariel Chinn","email":"b65620bb4df432d13ec1840f42b46c096610d784@gmail.com"},"message":"Fix dag_longest_path bug (#2703)\n\n* Fix dag_longest_path bug\r\n\r\nFix a bug in dag_longest_path that raises an exception when an empty\r\ngraph is given.\r\n\r\n* Adding test for empty graph","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/00a43573126279f51bc397fad62849c2a3d26997"},{"sha":"49fb7d68040d0709f7d12f6626b16007015d96e8","author":{"name":"aweltsch","email":"832818f2e08ed5e61dc6706df0a80987cf504b66@users.noreply.github.com"},"message":"Copy graph in transitive closure algorithm. (#2718)\n\nFixes #2578","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/49fb7d68040d0709f7d12f6626b16007015d96e8"},{"sha":"b1c576de85b4d0bbd4c4af793b97e951303f9be2","author":{"name":"Marco","email":"e8fc126dba85f4b93d77a2dca01b5e92fe12347c@users.noreply.github.com"},"message":"removed reference to create_using from union docs (#2722)","distinct":true,"url":"https://api.github.com/repos/jarrodmillman/networkx/commits/b1c576de85b4d0bbd4c4af793b97e951303f9be2"}]}
{"actor":{"display_login":"jarrodmillman"}}