{"push_id":2149158595,"size":13,"distinct_size":13,"ref":"refs/heads/master","head":"4bce5047cbe7fcd1865f577d90c0438bab3d67aa","before":"4454b2b93126f6ed313f64320b35e318c8b406a7","commits":[{"sha":"d9c0b3a09bdc62a6f3bf1379c9d379aa4f6d5a06","author":{"name":"gfyoung","email":"939f1bd98fa0a01ccb8eae80981894c4ae4a9bc7@gmail.com"},"message":"Correct when we raise NetworkXNotImplemented (#2731)\n\nalgorithms/components/connected.py was littered with incorrect descriptions that we raise NetworkXNotImplemented for undirected graphs, when we meant to say directed.","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/d9c0b3a09bdc62a6f3bf1379c9d379aa4f6d5a06"},{"sha":"e3566e53793cdccc19a8c2ff9c056e0d7b524634","author":{"name":"gfyoung","email":"939f1bd98fa0a01ccb8eae80981894c4ae4a9bc7@gmail.com"},"message":"Expand documentation regarding strong connectivity (#2732)\n\n* Define strong connectivity in the documentation\r\n\r\n* Note strongly connected implies weakly connected\r\n\r\nFor additional clarity, strong connections imply weak ones by definitions.","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/e3566e53793cdccc19a8c2ff9c056e0d7b524634"},{"sha":"45390255695cf21722aca2d2726b85bc2d6eaa7b","author":{"name":"David Bradway","email":"bdc46bcfd51c67dfc75024fc8b431b5c81f310f4@gmail.com"},"message":"fix typo in tutorial (#2746)\n\n2 -> 3","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/45390255695cf21722aca2d2726b85bc2d6eaa7b"},{"sha":"a660d5728b3b3463b08c03ab8138f62468487c71","author":{"name":"Dan Schult","email":"d65fd63286b00431bba9c9ccffeada8ee706b5d0@colgate.edu"},"message":"Speedups for subgraph and copy methods (#2744)\n\nFixes #2743\r\nAddresses #2716\r\nRelates to #2687","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/a660d5728b3b3463b08c03ab8138f62468487c71"},{"sha":"94e908ab14103a304f20754861e06c6fb69e52ef","author":{"name":"talhum","email":"7c2c846c0c64f3a1adc138a2f41809cc379daca2@users.noreply.github.com"},"message":"Update neighbor_degree.py (#2751)\n\ncorrected docs","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/94e908ab14103a304f20754861e06c6fb69e52ef"},{"sha":"8d9fef2512e0426c4e8bb7f5e760a66051dc2ce3","author":{"name":"Sanghack Lee","email":"7b27a49975f19e668d52c2e6b300bb7c5694e485@gmail.com"},"message":"fix add_path to add the first node when the length of the given node list is one","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/8d9fef2512e0426c4e8bb7f5e760a66051dc2ce3"},{"sha":"335b5b15435fcdac37a578b101163ab768374561","author":{"name":"Aric Hagberg","email":"79fcf62a801b92828b27f0ed0b06756bcaae8020@gmail.com"},"message":"Merge pull request #2759 from sanghack81/bugfix-for-issue-2726\n\nFix #2726: ensure add_path to add the first node","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/335b5b15435fcdac37a578b101163ab768374561"},{"sha":"32ba6954a42de2a7569ee45e9df41a98c29a333b","author":{"name":"John Wegis","email":"719a6db69ac0123e4a06bf299f7c7210b6ce1607@socialcodeinc.com"},"message":"Issue 2763: Fix typo `furether` in networkx tutorial documentation","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/32ba6954a42de2a7569ee45e9df41a98c29a333b"},{"sha":"d5be0b25a2e07b6dfb1c343b0357b7dcf35e9306","author":{"name":"Aric Hagberg","email":"79fcf62a801b92828b27f0ed0b06756bcaae8020@gmail.com"},"message":"Merge pull request #2764 from jwegis/bugfix-for-issue-2763\n\nFix 2763: Typo `furether` in networkx tutorial documentation","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/d5be0b25a2e07b6dfb1c343b0357b7dcf35e9306"},{"sha":"196fad406dbe3fbba77d4f5f2c5bcfc1693dba1b","author":{"name":"Dan Schult","email":"d65fd63286b00431bba9c9ccffeada8ee706b5d0@colgate.edu"},"message":"Dictionary comprehensions from #1700 merged conflicts (#2768)\n\n* use dict comprehensions in kcomponents.py\r\n\r\n* use dict comprehensions in test_kcomponents\r\n\r\n* use dict comprehensions in test_kcutsets\r\n\r\n* use dict comprehensions in test_maxflow\r\n\r\n* use dict comprehensions in test_maxflow_large_graph\r\n\r\n* use dict comprehensions in flow/utils.py\r\n\r\n* use dict comprehensions in weighted.py\r\n\r\n* use dict comprehensions in graphml.py\r\n\r\n* use dict comprehensions in nx_pylab.py\r\n\r\n* use dict comprehensions in relabel.py\r\n\r\n* use dict comprehensions in assortavity/mixing.py\r\n\r\n* conform to pep8 guidelines in mixing.py\r\n\r\n* Minor tweaks to kcomponents to update to v2.0","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/196fad406dbe3fbba77d4f5f2c5bcfc1693dba1b"},{"sha":"8fb36ea39dbe77f966360384e300fc05e31ddc44","author":{"name":"Dan Schult","email":"d65fd63286b00431bba9c9ccffeada8ee706b5d0@colgate.edu"},"message":"Fix bug and add checks for non-convergent fiedler_vector (#2681)\n\n* Fix method choice for alg_conn and fiedler_vector\r\n\r\nStill getting random hanging with tracemin_pcg though.\r\nThis is a step toward #2381\r\n\r\n* Add check for nonconvergence of pcg method.\r\n\r\nActually checks that 2nd col of W (used to find fiedler vector)\r\ndoes not have l_1 norm below 1e-10.\r\n\r\n* Rewrite fiedler tracemin_pcg\r\n\r\nThe Fiedler vector pcg method in rare (but sometimes simple) cases\r\nprojected away too much energy from b in Ax=b so that x was within\r\nroundoff error and the solver never finished (hung). Despite efforts\r\nto restore the energy, add noise in orthogonal directions and project\r\neither more or less often, the system would hang on unlucky initial\r\nconditions. (Though I did get it to only hang 5 times out of 1 million\r\nseeds.)\r\n\r\nIn the end I took a hint from a comment line that the PCG method was\r\nusing a different but mathematically equivalent method to that of\r\nCholesky and LU. Rewriting the PCG method to use the same mathematical\r\nstatement as the Chol and LU methods did the trick. Many fewer\r\nprojections might save time, certainly simpler code, and the\r\nvectors are not close to round-off size. Trials with simple graph\r\nand initial conditions from seeds 1:1000000 show no signs of hanging.\r\n\r\nI believe we can now remove the restriction in the tests that the seed\r\nbe the same each time we test.  Is there a reason to keep the seeds\r\nthe same other than avoiding an infinite loop?\r\n\r\n* Move preserve_random_state to utils.py\r\n\r\nRemove it from test_algebraic_connectivity.\r\nIt is currently not used anywhere in NetworkX but maybe should be.\r\n\r\n* Move numpy import to appropriate place in tests_alg_con","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/8fb36ea39dbe77f966360384e300fc05e31ddc44"},{"sha":"1e5b2ba61ab107a2e200f0cb7931afe32c9996d5","author":{"name":"Dan Schult","email":"d65fd63286b00431bba9c9ccffeada8ee706b5d0@colgate.edu"},"message":"Fix typo in write_gml and add test (#2769)","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/1e5b2ba61ab107a2e200f0cb7931afe32c9996d5"},{"sha":"4bce5047cbe7fcd1865f577d90c0438bab3d67aa","author":{"name":"ForFer","email":"b7d7942a71e408216b6e9fe172b121ab1a9b0fe6@protonmail.com"},"message":"all_simple_paths should not return cycles. Fix issue #2762 (#2770)\n\nall_simple_paths should not return cycles. Fixes #2762","distinct":true,"url":"https://api.github.com/repos/mddddd/networkx/commits/4bce5047cbe7fcd1865f577d90c0438bab3d67aa"}]}
{"actor":{"display_login":"mddddd"}}