{"push_id":707265249,"size":80,"distinct_size":27,"ref":"refs/heads/master","head":"5c2d032b094f179201d1036dff44d929875ddb79","before":"64888598b4cf837c2168bbecd150024a8468997c","commits":[{"sha":"881aa2c4980ae2df6c2f220436bc2e766b2b14f8","author":{"email":"d61e9061586aecc93cb1f6133d0b8c860b6e5a48@windowslive.com","name":"Thodoris Sotiropoulos"},"message":"Update johnson() to not modify graph","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/881aa2c4980ae2df6c2f220436bc2e766b2b14f8"},{"sha":"a277a8254ca2bfe1632417946e85c35acdbd73c3","author":{"email":"d61e9061586aecc93cb1f6133d0b8c860b6e5a48@windowslive.com","name":"Thodoris Sotiropoulos"},"message":"Add _dijkstra_relaxation function, update johnson\n\nAdd _djikstra relaxation() function for the relaxation loop of Dijkstra\nalgorithm\nUpdate johnson algorithm not to modify graph","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/a277a8254ca2bfe1632417946e85c35acdbd73c3"},{"sha":"aa5ac8b61b1cb66842e48b1167b1a2381280f07e","author":{"email":"d61e9061586aecc93cb1f6133d0b8c860b6e5a48@windowslive.com","name":"Thodoris Sotiropoulos"},"message":"Modify lambdas and rename _dijkstra function","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/aa5ac8b61b1cb66842e48b1167b1a2381280f07e"},{"sha":"6a65210247d5e65e17e134d5234207d36d9c006a","author":{"email":"d61e9061586aecc93cb1f6133d0b8c860b6e5a48@windowslive.com","name":"Thodoris Sotiropoulos"},"message":"Minor code improvements","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/6a65210247d5e65e17e134d5234207d36d9c006a"},{"sha":"00c935fa2d6ad36f813a0f470547d7d707fb066f","author":{"email":"ae14ba0046c28cacae270838b329b00dff872628@gmail.com","name":"SanketDG"},"message":"make identified_nodes an alias for contracted_nodes","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/00c935fa2d6ad36f813a0f470547d7d707fb066f"},{"sha":"4f7c16b866a6d62f44e83cc26c03325b6cc730d8","author":{"email":"d61e9061586aecc93cb1f6133d0b8c860b6e5a48@windowslive.com","name":"Thodoris Sotiropoulos"},"message":"Enhance code readability","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/4f7c16b866a6d62f44e83cc26c03325b6cc730d8"},{"sha":"330fd210d29f5ca4d8f3bf9019cb4912b9f62fbe","author":{"email":"e15f550a7dc6cea9a7abb2b900b05cbbeab3ecec@users.noreply.github.com","name":"ysitu"},"message":"Merge pull request #1512 from Overriders/update-johnson\n\nUpdate Johnson's algorithm so that graph is not modified","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/330fd210d29f5ca4d8f3bf9019cb4912b9f62fbe"},{"sha":"609c5dafe9a9a8c6f15f1bf1875d1ef47b4ba1aa","author":{"email":"36e4c2143548d4459fee5b74cc602ea9bbb8fdd5@gmail.com","name":"chebee7i"},"message":"Merge pull request #1565 from SanketDG/identified_nodes\n\nmake identified_nodes an alias for contracted_nodes","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/609c5dafe9a9a8c6f15f1bf1875d1ef47b4ba1aa"},{"sha":"5d653919bc81543e2534bdaed751aa3e1ae1e14d","author":{"email":"6633f4551082e48d43e5d4f58882daa40e86460b@gmail.com","name":"Mridul Seth"},"message":"Add bfs test for directed graph in reverse direction","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/5d653919bc81543e2534bdaed751aa3e1ae1e14d"},{"sha":"35288e31f3fbab70026c7296a0a927fd13ea9845","author":{"email":"6633f4551082e48d43e5d4f58882daa40e86460b@gmail.com","name":"Mridul Seth"},"message":"PEP8 changes for networkx/algorithms/traversal/tests/test_bfs.py","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/35288e31f3fbab70026c7296a0a927fd13ea9845"},{"sha":"00afd39dae1612b47a8d478112115aaa37c93c93","author":{"email":"36e4c2143548d4459fee5b74cc602ea9bbb8fdd5@gmail.com","name":"chebee7i"},"message":"Merge pull request #1569 from MridulS/bfstest\n\nAdd bfs test for directed graph in reverse direction","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/00afd39dae1612b47a8d478112115aaa37c93c93"},{"sha":"138843738dc2e9ce931b9ec86ac0443e46e6e4da","author":{"email":"2345c0ac229046fbfe1ffcbadc78432215525266@gmail.com","name":"Jeffrey Finkelstein"},"message":"Fixes approximate dominating set greedy choice.\n\nBefore, the greedy algorithm for approximate dominating set chose each\nnode based on the sum of the weights in the closed neighborhood of the\nnode. Now it just uses the weight of the node. This fixes an issue that\ncauses, for example, the return value for a star graph to be all nodes\nother than the center node.","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/138843738dc2e9ce931b9ec86ac0443e46e6e4da"},{"sha":"d49733b61fb7dedfbbbdd9c04464adf6beb5db07","author":{"email":"36e4c2143548d4459fee5b74cc602ea9bbb8fdd5@gmail.com","name":"chebee7i"},"message":"Merge pull request #1566 from jfinkels/approximate-minimum-domset\n\nFixes approximate dominating set greedy choice.","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/d49733b61fb7dedfbbbdd9c04464adf6beb5db07"},{"sha":"cbc9c088898dff55cd6df6a8fb16a1221553dfdf","author":{"email":"ae14ba0046c28cacae270838b329b00dff872628@gmail.com","name":"SanketDG"},"message":"add _optimum_spanning_edges and maximum_spanning_edges","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/cbc9c088898dff55cd6df6a8fb16a1221553dfdf"},{"sha":"2559bdd88024167dcc2fb9c83b91a6cb11405700","author":{"email":"6633f4551082e48d43e5d4f58882daa40e86460b@gmail.com","name":"Mridul Seth"},"message":"Update documentation of networkx.algorithms.matching to include reference to networkx.algorithms.bipartite.matching for bipartite graphs","distinct":false,"url":"https://api.github.com/repos/SanketDG/networkx/commits/2559bdd88024167dcc2fb9c83b91a6cb11405700"},{"sha":"daedfdadff59d23b20b6857de3c23e47a40d088f","author":{"email":"ae14ba0046c28cacae270838b329b00dff872628@gmail.com","name":"SanketDG"},"message":"add test for maximum spanning edges and fix test bug","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/daedfdadff59d23b20b6857de3c23e47a40d088f"},{"sha":"899608e9a550fda8b7e8404c310b780d5c79232e","author":{"email":"2345c0ac229046fbfe1ffcbadc78432215525266@gmail.com","name":"Jeffrey Finkelstein"},"message":"Find maximum clique by cardinality.\n\nBefore, the maximum clique was chosen from a set of candidate cliques\naccording to the subset ordering on sets. This commit changes the code\nto choose the maximum clique according to clique size.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/899608e9a550fda8b7e8404c310b780d5c79232e"},{"sha":"c826e80802838152f178c7961cf82be9f9d287d0","author":{"email":"ae14ba0046c28cacae270838b329b00dff872628@gmail.com","name":"SanketDG"},"message":"add maximum_spanning_tree and refactor code in mst.py","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/c826e80802838152f178c7961cf82be9f9d287d0"},{"sha":"dba85275b5fc97b4de899f9a030e185455b78d2b","author":{"email":"ae14ba0046c28cacae270838b329b00dff872628@gmail.com","name":"SanketDG"},"message":"add tests for maximum_spanning_tree","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/dba85275b5fc97b4de899f9a030e185455b78d2b"},{"sha":"e9b0f8ff4580a9c476c315e413d57242f34c481d","author":{"email":"ae14ba0046c28cacae270838b329b00dff872628@gmail.com","name":"SanketDG"},"message":"add documentation for maximum_spanning_tree, pep8 fixes and fix #1575","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/e9b0f8ff4580a9c476c315e413d57242f34c481d"}]}