{"push_id":918410163,"size":77,"distinct_size":76,"ref":"refs/heads/master","head":"6e2db3386bc98285eacd52b6d42bcb547f59bf9d","before":"8ae8f11fe595bf049fc5343dfe25927912c44440","commits":[{"sha":"f72354e87998d0ad121df1c76bf8568175d1f20e","author":{"email":"bd3c73d0c1fbf3110b997a04694c03f490ece6af@gmail.com","name":"JGab"},"message":"Add approximation import","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/f72354e87998d0ad121df1c76bf8568175d1f20e"},{"sha":"ba7c5079701639d98a8032c4eaa4edf9138099c6","author":{"email":"bd3c73d0c1fbf3110b997a04694c03f490ece6af@gmail.com","name":"JGab"},"message":"Document approximation","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/ba7c5079701639d98a8032c4eaa4edf9138099c6"},{"sha":"f2235c4cd827154c5c8b468a06b7e02344cfdc75","author":{"email":"bd3c73d0c1fbf3110b997a04694c03f490ece6af@gmail.com","name":"JGab"},"message":"Merge remote-tracking branch 'upstream/master' into fix_approximation_import","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/f2235c4cd827154c5c8b468a06b7e02344cfdc75"},{"sha":"5b96281229e80cc6e887120ad538ede81edf92d1","author":{"email":"2345c0ac229046fbfe1ffcbadc78432215525266@gmail.com","name":"Jeffrey Finkelstein"},"message":"Adds test for whether graph is strongly regular.\n\nThis commit introduces the `is_strongly_regular` function.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/5b96281229e80cc6e887120ad538ede81edf92d1"},{"sha":"b5a17d93cdc7c75ef73b73d71fa3006c89dd9eaa","author":{"email":"2345c0ac229046fbfe1ffcbadc78432215525266@gmail.com","name":"Jeffrey Finkelstein"},"message":"Simplifies dominating set functions.\n\nAlso updates documentation and makes PEP8 fixes.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/b5a17d93cdc7c75ef73b73d71fa3006c89dd9eaa"},{"sha":"b2189ca480ba1566ae446e597ae4b98d643d082f","author":{"email":"2345c0ac229046fbfe1ffcbadc78432215525266@gmail.com","name":"Jeffrey Finkelstein"},"message":"Return minimum spanning edge keys for multigraphs\n\nBefore, the `minimum_spanning_edges()` function returned edges without\nedge keys for multigraphs. This commit enables the user to choose to\nreturn edge keys in addition to edges in a multigraph.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/b2189ca480ba1566ae446e597ae4b98d643d082f"},{"sha":"6ed910cd2f78bfdde3a6bab03fe8fb48488a35cb","author":{"email":"8678d91aceeffb4195d952677da14c0fa738a21d@gmail.com","name":"Joshua Harlow"},"message":"Add IRC channel to README.rst\n\nA IRC channel has been made where discussion can be performed\nabout networkx, using the popular opensource freenode servers\nso it might as well be mentioned in the README.rst so people\ncan find it as needed.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/6ed910cd2f78bfdde3a6bab03fe8fb48488a35cb"},{"sha":"3bbb7fa7ed673382ecb25e3e543388b0d0455b01","author":{"email":"8678d91aceeffb4195d952677da14c0fa738a21d@yahoo-inc.com","name":"Joshua Harlow"},"message":"Add a web IRC client link","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/3bbb7fa7ed673382ecb25e3e543388b0d0455b01"},{"sha":"943c96f9c510b1b4cfb71007723c50bba21d0e84","author":{"email":"2345c0ac229046fbfe1ffcbadc78432215525266@gmail.com","name":"Jeffrey Finkelstein"},"message":"Moves triad_graph function to generators package.\n\nPreviously, the `triad_graphs` function in the\n`networkx.algorithms.triads` module, returned a dictionary containing a\ngraph representing each possible triad. This commit moves that function\nto a new module, `networkx.generators.triads`, and adds previously\nmissing test code for that function. It also modifies the function to\nreturn a single graph instead of a dictionary of graphs. The dictionary\ncan now be generated by the code\n\n    from networkx.algorithms.triads import TRIAD_NAMES\n    triad_graphs = {name: triad_graph(name) for name in TRIAD_NAMES}","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/943c96f9c510b1b4cfb71007723c50bba21d0e84"},{"sha":"12826ab07b15e92241cda4d870b16777b31bed8a","author":{"email":"2345c0ac229046fbfe1ffcbadc78432215525266@gmail.com","name":"Jeffrey Finkelstein"},"message":"Rewrites quotient so it can implement block model\n\nThis commit removes the `blockmodel()` function (and its containing\nmodule `networkx.algorithms.block`) and adds code to the\n`quotient_graph()` function so that it can handle the use cases for\n`blockmodel()`.\n\nThis is a backwards-incompatible change; it removes a function.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/12826ab07b15e92241cda4d870b16777b31bed8a"},{"sha":"4cd32dd0780e0e1147d347a5a0c47532c29ac976","author":{"email":"2345c0ac229046fbfe1ffcbadc78432215525266@gmail.com","name":"Jeffrey Finkelstein"},"message":"Makes balanced unary tree generator return path.\n\nPreviously, the `balanced_tree` generator function always returned a\npath graph on two nodes instead of a path graph of the appropriate\nlength when provided a branching factor of one. This corrects that error\nso the function now returns the path graph on `h + 1` nodes, where `h`\nis the specified height of the tree, when the branching factor is one.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/4cd32dd0780e0e1147d347a5a0c47532c29ac976"},{"sha":"bccec95fd331cc80b6772163a8f6feaf4e823647","author":{"email":"874b16a72890ae4c0e083af7604f7f1083171c4e@gmail.com","name":"Aric Hagberg"},"message":"Add random kernel graph generator\n\nGenerator of random graphs with a specified kernel.\nIncludes a simple test and example to generate a G(n,p) graph using a kernel.\nThe method is detailed in a (currently unpublished) paper.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/bccec95fd331cc80b6772163a8f6feaf4e823647"},{"sha":"729a7ad7220c2746c0fdfcd855714bbd07786f8e","author":{"email":"2345c0ac229046fbfe1ffcbadc78432215525266@gmail.com","name":"Jeffrey Finkelstein"},"message":"Removes unnecessary code in harmonic centrality.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/729a7ad7220c2746c0fdfcd855714bbd07786f8e"},{"sha":"77eaf107c7dc88c6844493a056227bd08183125c","author":{"email":"6685c40ec632c624ed51d564162932e7162fbf43@gmail.com","name":"Emilien Kofman"},"message":"Bugfix (or simplification) of the size method in the Graph class","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/77eaf107c7dc88c6844493a056227bd08183125c"},{"sha":"4ae43620fd5cf4a4ad0dec4a195398228c483a7d","author":{"email":"6685c40ec632c624ed51d564162932e7162fbf43@gmail.com","name":"Emilien Kofman"},"message":"removed from future...","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/4ae43620fd5cf4a4ad0dec4a195398228c483a7d"},{"sha":"f200bfb309b0ebdfc0ffa91dec3ac3c0696cb6b0","author":{"email":"2345c0ac229046fbfe1ffcbadc78432215525266@gmail.com","name":"Jeffrey Finkelstein"},"message":"Adds functions operating on tournament graphs.\n\nCreates a new module, `networkx.algorithms.tournament`.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/f200bfb309b0ebdfc0ffa91dec3ac3c0696cb6b0"},{"sha":"c8569c4a7274e9171548745c2840477d11c1ae20","author":{"email":"6685c40ec632c624ed51d564162932e7162fbf43@gmail.com","name":"Emilien Kofman"},"message":"graph.size update thanks to @jfinkels suggestions. See #1798.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/c8569c4a7274e9171548745c2840477d11c1ae20"},{"sha":"5377d9773e6f3da0b8ab05480c2c09a140e38f90","author":{"email":"d9baac34faa30bfa6e41fb7bf5dcb897a175e4f2@jacobs-university.de","name":"Moritz Emanuel Beber"},"message":"first file additions for community detection\n\nAdded files from @bjedwards' GSoC repository over on bitbucket\n(https://bitbucket.org/bedwards/networkx-community) that have tests. Further\nfiles remain but testing needs to be added.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/5377d9773e6f3da0b8ab05480c2c09a140e38f90"},{"sha":"37ed3794122cf2d4bc685d33925877b18050f8a0","author":{"email":"d9baac34faa30bfa6e41fb7bf5dcb897a175e4f2@jacobs-university.de","name":"Moritz Emanuel Beber"},"message":"first file additions for community detection\n\nAdded files from @bjedwards' GSoC repository over on bitbucket\n(https://bitbucket.org/bedwards/networkx-community) that have tests. Further\nfiles remain but testing needs to be added.","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/37ed3794122cf2d4bc685d33925877b18050f8a0"},{"sha":"f09fd7b13751b0706a884c6da71069e4449b06d3","author":{"email":"d9baac34faa30bfa6e41fb7bf5dcb897a175e4f2@jacobs-university.de","name":"Moritz Emanuel Beber"},"message":"added spectrum.py from @bjedwards' code\n\n* fixed a few function references and other minor points\n* still many references are incomplete or wrong","distinct":true,"url":"https://api.github.com/repos/SanketDG/networkx/commits/f09fd7b13751b0706a884c6da71069e4449b06d3"}]}