{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":673409924,"defaultBranch":"main","name":"graph-braid-splitter","ownerLogin":"danberlyne","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-08-01T14:59:35.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/104771503?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1690901978.0","currentOid":""},"activityList":{"items":[{"before":"1552b7ec3c631b6fe3b2b0ba3800fd124b9dc777","after":"0744a3eac552d85085395403af1d60621a59a92d","ref":"refs/heads/main","pushedAt":"2024-03-06T18:32:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added unit test for single-edge graph of groups","shortMessageHtmlLink":"added unit test for single-edge graph of groups"}},{"before":"08f24db75c01f5d60d3885795d97e95e05625233","after":"1552b7ec3c631b6fe3b2b0ba3800fd124b9dc777","ref":"refs/heads/main","pushedAt":"2024-03-05T18:36:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"fixed circular import","shortMessageHtmlLink":"fixed circular import"}},{"before":"2b3ed133d2a21d61f2ac303cc5f5f2e0c2317454","after":"08f24db75c01f5d60d3885795d97e95e05625233","ref":"refs/heads/main","pushedAt":"2024-03-04T16:41:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added type aliases","shortMessageHtmlLink":"added type aliases"}},{"before":"79f1a7a683443d006319fd17048a7ae7dcf39277","after":"2b3ed133d2a21d61f2ac303cc5f5f2e0c2317454","ref":"refs/heads/main","pushedAt":"2024-03-01T18:18:40.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added type hints","shortMessageHtmlLink":"added type hints"}},{"before":"383a5e5a1a7f2098f828c1647e54a5b6f5182a84","after":"79f1a7a683443d006319fd17048a7ae7dcf39277","ref":"refs/heads/main","pushedAt":"2024-02-29T08:16:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added type hinting","shortMessageHtmlLink":"added type hinting"}},{"before":"eedbf88201fa1f5b9e5d9dee4ddea48e5eac7f02","after":"383a5e5a1a7f2098f828c1647e54a5b6f5182a84","ref":"refs/heads/main","pushedAt":"2024-02-28T10:14:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added type hinting","shortMessageHtmlLink":"added type hinting"}},{"before":"b2c00202f3af5d8fdf4f73323e641e960d22f2da","after":"eedbf88201fa1f5b9e5d9dee4ddea48e5eac7f02","ref":"refs/heads/main","pushedAt":"2024-02-26T18:33:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added type hints; fixed error in `prune` docstring","shortMessageHtmlLink":"added type hints; fixed error in <code>prune</code> docstring"}},{"before":"7b85310cbd941907e9645ba0421c46cdf9fc784c","after":"b2c00202f3af5d8fdf4f73323e641e960d22f2da","ref":"refs/heads/main","pushedAt":"2024-02-23T06:52:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added docstrings; added `with` statements for file access","shortMessageHtmlLink":"added docstrings; added <code>with</code> statements for file access"}},{"before":"697b3148408aa1e1ffe4ebbb30320715ba5d6a76","after":"7b85310cbd941907e9645ba0421c46cdf9fc784c","ref":"refs/heads/main","pushedAt":"2024-02-22T07:27:54.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added docstrings","shortMessageHtmlLink":"added docstrings"}},{"before":"9b793bd4722450723ec4d8710fc93b2b7ff67d00","after":"697b3148408aa1e1ffe4ebbb30320715ba5d6a76","ref":"refs/heads/main","pushedAt":"2024-02-21T17:45:45.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added docstrings","shortMessageHtmlLink":"added docstrings"}},{"before":"4e686594e7da92697d0472854fc0c383f3b2acd9","after":"9b793bd4722450723ec4d8710fc93b2b7ff67d00","ref":"refs/heads/main","pushedAt":"2024-02-15T10:05:59.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added docstring describing package functionality and contents","shortMessageHtmlLink":"added docstring describing package functionality and contents"}},{"before":"f52fd8c90322ccf6298277a923fcd52f39c3aa6e","after":"4e686594e7da92697d0472854fc0c383f3b2acd9","ref":"refs/heads/main","pushedAt":"2024-02-14T17:32:55.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"corrected outdated comment","shortMessageHtmlLink":"corrected outdated comment"}},{"before":"4f1dd5907cc2b76d21a8d7e77ce644e0a450e3e7","after":"f52fd8c90322ccf6298277a923fcd52f39c3aa6e","ref":"refs/heads/main","pushedAt":"2024-02-07T17:02:53.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added test case for braid group of 10-pronged radial tree","shortMessageHtmlLink":"added test case for braid group of 10-pronged radial tree"}},{"before":"94ff6b9edda5d3e52bcd9b81f1f95b21550e4cc1","after":"4f1dd5907cc2b76d21a8d7e77ce644e0a450e3e7","ref":"refs/heads/main","pushedAt":"2024-02-06T10:51:18.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added test case for braid group of K5","shortMessageHtmlLink":"added test case for braid group of K5"}},{"before":"540a267424bc12db29e89d8b7c6bf0fe0e6cf08e","after":"94ff6b9edda5d3e52bcd9b81f1f95b21550e4cc1","ref":"refs/heads/main","pushedAt":"2024-01-21T11:37:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"fixed test data for 3-pronged star braid group","shortMessageHtmlLink":"fixed test data for 3-pronged star braid group"}},{"before":"6ebcbd0cfae66cd4b811ebd19c805f01ddf400e4","after":"540a267424bc12db29e89d8b7c6bf0fe0e6cf08e","ref":"refs/heads/main","pushedAt":"2024-01-20T11:33:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"fixed issue with `integer_partitions()` generator being exhausted in `get_compatible_assignments()`","shortMessageHtmlLink":"fixed issue with <code>integer_partitions()</code> generator being exhausted in …"}},{"before":"3b2bdde1286130b9f88ac9db62097e0738e4f7cf","after":"6ebcbd0cfae66cd4b811ebd19c805f01ddf400e4","ref":"refs/heads/main","pushedAt":"2024-01-19T21:49:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"fixed hashing errors with equality operators","shortMessageHtmlLink":"fixed hashing errors with equality operators"}},{"before":"6bc83137133c2f3cf57650e7ad950b5aa0818c5f","after":"3b2bdde1286130b9f88ac9db62097e0738e4f7cf","ref":"refs/heads/main","pushedAt":"2024-01-18T21:12:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added test case for braid groups of star graphs","shortMessageHtmlLink":"added test case for braid groups of star graphs"}},{"before":"f0f130654b1f68ee62e037d1708aceaa3477edc5","after":"6bc83137133c2f3cf57650e7ad950b5aa0818c5f","ref":"refs/heads/main","pushedAt":"2024-01-17T18:31:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"improved equality operator for GraphBraidGroup class, fixed 3-segment test case","shortMessageHtmlLink":"improved equality operator for GraphBraidGroup class, fixed 3-segment…"}},{"before":"8817ea2dd4ac55a0622f6c2c8def7ac90f41bc72","after":"f0f130654b1f68ee62e037d1708aceaa3477edc5","ref":"refs/heads/main","pushedAt":"2024-01-16T22:04:03.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"updated test case for GraphBraidGroup class","shortMessageHtmlLink":"updated test case for GraphBraidGroup class"}},{"before":"c8baa97be4e27f9531d2d82c0a612c7d7d68e7a6","after":"8817ea2dd4ac55a0622f6c2c8def7ac90f41bc72","ref":"refs/heads/main","pushedAt":"2024-01-15T22:13:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added new test case for GraphBraidGroup class","shortMessageHtmlLink":"added new test case for GraphBraidGroup class"}},{"before":"2a2a1e857e3d88faacd95c9c6b2b462538a5a173","after":"c8baa97be4e27f9531d2d82c0a612c7d7d68e7a6","ref":"refs/heads/main","pushedAt":"2024-01-14T21:43:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"implemented equality operator for GraphBraidGroup and GraphOfGroups classes","shortMessageHtmlLink":"implemented equality operator for GraphBraidGroup and GraphOfGroups c…"}},{"before":"fd94a6a76355f090f2bf311b31f0bf85d7f52017","after":"2a2a1e857e3d88faacd95c9c6b2b462538a5a173","ref":"refs/heads/main","pushedAt":"2024-01-13T18:34:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added initial test case for GraphBraidGroup class","shortMessageHtmlLink":"added initial test case for GraphBraidGroup class"}},{"before":"6416f7ea2b84a6249506a5677a498f72f3b39d51","after":"fd94a6a76355f090f2bf311b31f0bf85d7f52017","ref":"refs/heads/main","pushedAt":"2024-01-12T23:40:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"optimised memory usage when checking if two adjacency matrices define same graph","shortMessageHtmlLink":"optimised memory usage when checking if two adjacency matrices define…"}},{"before":"859e72c5fb2fee8f4d913134c2f28a68f0c245ca","after":"6416f7ea2b84a6249506a5677a498f72f3b39d51","ref":"refs/heads/main","pushedAt":"2024-01-11T19:46:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"optimised efficiency of graph methods","shortMessageHtmlLink":"optimised efficiency of graph methods"}},{"before":"a38c047a50e894800fed979f8e057fa29bbd0d45","after":"859e72c5fb2fee8f4d913134c2f28a68f0c245ca","ref":"refs/heads/main","pushedAt":"2024-01-10T22:31:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"fixed bug with handling of loops when making a graph essential","shortMessageHtmlLink":"fixed bug with handling of loops when making a graph essential"}},{"before":"4b1626e7971e9c5dbf10742908aab551dbf138fe","after":"a38c047a50e894800fed979f8e057fa29bbd0d45","ref":"refs/heads/main","pushedAt":"2024-01-09T21:35:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added ability to detect separating edges in graphs with multiple components","shortMessageHtmlLink":"added ability to detect separating edges in graphs with multiple comp…"}},{"before":"6e40c64c1324dc09cb854af6ec569523527839c4","after":"4b1626e7971e9c5dbf10742908aab551dbf138fe","ref":"refs/heads/main","pushedAt":"2024-01-05T06:35:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"changed ordering of graph edges to be lexicographic","shortMessageHtmlLink":"changed ordering of graph edges to be lexicographic"}},{"before":"6ab9f2fe4f83a5b71420ad677372ed9ac8156390","after":"6e40c64c1324dc09cb854af6ec569523527839c4","ref":"refs/heads/main","pushedAt":"2024-01-04T17:18:26.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added ability to handle multi-edges in graphs","shortMessageHtmlLink":"added ability to handle multi-edges in graphs"}},{"before":"f6e9f1ae5255b8e8a5af02c99e878d19f10a00ec","after":"6ab9f2fe4f83a5b71420ad677372ed9ac8156390","ref":"refs/heads/main","pushedAt":"2024-01-03T17:54:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"danberlyne","name":"Daniel Berlyne","path":"/danberlyne","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/104771503?s=80&v=4"},"commit":{"message":"added ability to handle loops in graphs","shortMessageHtmlLink":"added ability to handle loops in graphs"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEDkTsjQA","startCursor":null,"endCursor":null}},"title":"Activity · danberlyne/graph-braid-splitter"}