{"push_id":1241672969,"size":29,"distinct_size":0,"ref":"refs/heads/master","head":"d67f13025fc438149874fee70879a2d5ab22d0ec","before":"d0e4b1a4fae7f3bf646e3dfff7b9f1a4411f6b1a","commits":[{"sha":"0eeec9e95bb106e59710ca997b3c8eeadb861158","author":{"name":"Jeffrey Finkelstein","email":"324efe033dd67fa306b970452033327a9fa4ba98@gmail.com"},"message":"Moves Graph Atlas to data file.\n\nThis commit moves the edge lists of the graphs in the graph atlas from a\nPython list defined in `networkx/generators/atlas.py` to a text file in\nthe same directory. This means that accessing the list of atlas graphs\nwill cause a file read.\n\nThis also adds a new function, `graph_atlas(i)`, that outputs only the\n`i`th graph from the atlas.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/0eeec9e95bb106e59710ca997b3c8eeadb861158"},{"sha":"b8cacb403c8a22e5862f14c79a4bf0aab3d83126","author":{"name":"Jeffrey Finkelstein","email":"324efe033dd67fa306b970452033327a9fa4ba98@gmail.com"},"message":"Include atlas data file in package","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/b8cacb403c8a22e5862f14c79a4bf0aab3d83126"},{"sha":"088236a053adf5d7167b3047c720714e0ad3ae2c","author":{"name":"Jeffrey Finkelstein","email":"324efe033dd67fa306b970452033327a9fa4ba98@gmail.com"},"message":"Gzips graph atlas data file.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/088236a053adf5d7167b3047c720714e0ad3ae2c"},{"sha":"16a27101339a889d01b13248297db6f3251f0a7e","author":{"name":"Jeffrey Finkelstein","email":"324efe033dd67fa306b970452033327a9fa4ba98@gmail.com"},"message":"Notes exceptions to degree sequence order in atlas","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/16a27101339a889d01b13248297db6f3251f0a7e"},{"sha":"3c73d9a791bda5ee698d781772e9308a71fd8db2","author":{"name":"Jeffrey Finkelstein","email":"324efe033dd67fa306b970452033327a9fa4ba98@gmail.com"},"message":"Fixes typo in setup.py: atlas.dat -> atlas.dat.gz.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/3c73d9a791bda5ee698d781772e9308a71fd8db2"},{"sha":"a831a0ec013adc075a4cbdca2b8ad4b5b8f0c9c3","author":{"name":"Jordi Torrents","email":"515bb1d9343c765fb94da035bb7d55b44513e0ea@gmail.com"},"message":"Refactor Dinitz' algorithm implementation.\n\nReimplemented the DFS iteratively instead of recursively. This\nspeeds up the running time considerably, specially for problems\nin which the paths between source and sink are long, such as big\nand sparse networks (eg social networks). For dense networks, in\nwhich the paths are typically short, the running time is very\nsimmilar to the recursive implementation.\n\nThe speed up in the running time makes now possible to use Dinitz'\nalgorithm for testing the large graphs in `test_maxflow_large_graph.py`.\nThus we are now using all flow algorithms in all flow tests.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/a831a0ec013adc075a4cbdca2b8ad4b5b8f0c9c3"},{"sha":"0a2becdc7f5b5602d6cebba488dc6f9017b665fa","author":{"name":"Valentin Lorentz","email":"b8ec2bed498b63babaa39d6833e24d2d66f51cd9@progval.net"},"message":"Add support for subgraphs with no edges in convert_matrix.to_scipy_sparse_matrix.\n\nCloses GH-2181.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/0a2becdc7f5b5602d6cebba488dc6f9017b665fa"},{"sha":"b14b4806948af0309bc70be10022d80e28185956","author":{"name":"Valentin Lorentz","email":"b8ec2bed498b63babaa39d6833e24d2d66f51cd9@progval.net"},"message":"Add support for reading adjacency matrix in readwrite.pajek.parse_pajek.\n\nCloses GH-2123.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/b14b4806948af0309bc70be10022d80e28185956"},{"sha":"d61e637679d96dc73bbb046c690677e300fa690e","author":{"name":"Valentin Lorentz","email":"b8ec2bed498b63babaa39d6833e24d2d66f51cd9@progval.net"},"message":"Simplify logic in TestOpenFileDecorator.write_*.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/d61e637679d96dc73bbb046c690677e300fa690e"},{"sha":"3d71558294f848d291a162542885e20eda958154","author":{"name":"Valentin Lorentz","email":"b8ec2bed498b63babaa39d6833e24d2d66f51cd9@progval.net"},"message":"Delete temporary files after tests end.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/3d71558294f848d291a162542885e20eda958154"},{"sha":"d2fe7bd3757bd4f33aa34598e70cca9c28e7ac1e","author":{"name":"Aric Hagberg","email":"79fcf62a801b92828b27f0ed0b06756bcaae8020@gmail.com"},"message":"Merge pull request #2202 from ProgVal/remove-temporary-files\n\nRemove temporary files after tests are run.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/d2fe7bd3757bd4f33aa34598e70cca9c28e7ac1e"},{"sha":"7c4d66e67b239507244234fc5b90687dc0668815","author":{"name":"Valentin Lorentz","email":"b8ec2bed498b63babaa39d6833e24d2d66f51cd9@progval.net"},"message":"Fix tests failing because of ordering issues.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/7c4d66e67b239507244234fc5b90687dc0668815"},{"sha":"97bd854ac46fc4ed6b918ccbad7e66c89429541a","author":{"name":"Aric Hagberg","email":"79fcf62a801b92828b27f0ed0b06756bcaae8020@gmail.com"},"message":"Merge pull request #2199 from ProgVal/issue-2181\n\nAdd support for subgraphs with no edges in convert_matrix.to_scipy_sparse_matrix.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/97bd854ac46fc4ed6b918ccbad7e66c89429541a"},{"sha":"32557ffba604a1de0f1b9343f222bed7fef3a78e","author":{"name":"Valentin Lorentz","email":"b8ec2bed498b63babaa39d6833e24d2d66f51cd9@progval.net"},"message":"Don't depend on numpy to parse Pajek adjacency matrices.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/32557ffba604a1de0f1b9343f222bed7fef3a78e"},{"sha":"3aa5757f23b1e0631965523afb66ea15f23d0ec6","author":{"name":"Aric Hagberg","email":"79fcf62a801b92828b27f0ed0b06756bcaae8020@gmail.com"},"message":"Merge pull request #2200 from ProgVal/issue-2123\n\nAdd support for reading adjacency matrix in readwrite.pajek.parse_pajek.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/3aa5757f23b1e0631965523afb66ea15f23d0ec6"},{"sha":"f1a7670110c0a2f4074a97a0a7f56abb69e09bf3","author":{"name":"Aric Hagberg","email":"79fcf62a801b92828b27f0ed0b06756bcaae8020@gmail.com"},"message":"Merge pull request #2064 from jfinkels/fix-atlas\n\nMoves Graph Atlas to data file.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/f1a7670110c0a2f4074a97a0a7f56abb69e09bf3"},{"sha":"0418e01085a8d2a193ce7b6252ac0de354b2bb36","author":{"name":"Aric Hagberg","email":"79fcf62a801b92828b27f0ed0b06756bcaae8020@gmail.com"},"message":"Merge pull request #2196 from jtorrents/dinitz-iter\n\nRefactor Dinitz' algorithm implementation.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/0418e01085a8d2a193ce7b6252ac0de354b2bb36"},{"sha":"d0b3c3f6aefe7f985f202d8b6c7742efbf1d3ecb","author":{"name":"Pim Otte","email":"58886e022faa55680616c7ee29a30ddf4a266c77@gmail.com"},"message":"2205: Adding support for specific data retrival of edges through in_edges (DiGraph and MultiDiGraph)","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/d0b3c3f6aefe7f985f202d8b6c7742efbf1d3ecb"},{"sha":"09a8a0c29019f43d31b547304c5ce01e8dce1f4a","author":{"name":"Pim Otte","email":"58886e022faa55680616c7ee29a30ddf4a266c77@gmail.com"},"message":"Extra tests","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/09a8a0c29019f43d31b547304c5ce01e8dce1f4a"},{"sha":"613fe3b4fba7800e70ff6d4b1b0b8276a9493755","author":{"name":"Valentin Lorentz","email":"b8ec2bed498b63babaa39d6833e24d2d66f51cd9@progval.net"},"message":"Use arrays instead of matrices in subgraph_alg.py.\n\nCloses GH-2194.","distinct":false,"url":"https://api.github.com/repos/ProgVal/networkx/commits/613fe3b4fba7800e70ff6d4b1b0b8276a9493755"}]}
{"actor":{"display_login":"ProgVal"}}