{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":186025444,"defaultBranch":"main","name":"rustworkx","ownerLogin":"Qiskit","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2019-05-10T17:09:02.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/30696987?v=4","public":true,"private":false,"isOrgOwned":true},"refInfo":{"name":"","listCacheKey":"v0:1715792376.0","currentOid":""},"activityList":{"items":[{"before":"b3206565319c2d177cde31f1ceba3c431538cbe4","after":"52759c92cfe593df0f1f2920eca1213dda3d9b15","ref":"refs/heads/gh-pages","pushedAt":"2024-05-22T14:12:08.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: 955d9890ac7073c3eb8878e4fdcfeedfeef3e73d","shortMessageHtmlLink":"deploy: 955d989"}},{"before":"c039731294e76395b263d1eaa3c6dba075a87f8f","after":"955d9890ac7073c3eb8878e4fdcfeedfeef3e73d","ref":"refs/heads/main","pushedAt":"2024-05-22T14:04:05.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"mtreinish","name":"Matthew Treinish","path":"/mtreinish","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/2447371?s=80&v=4"},"commit":{"message":"Add `graph` module, port `contract_nodes` and `has_parallel_edges` to core. (#1143)\n\n* Port contract_nodes to core.\r\n\r\n* Explicit implementations for just StableGraph and GraphMap.\r\n\r\n* Simplify to just graph_ext.\r\n\r\n* Rename integration tests to graph_ext.\r\n\r\n* Add module docs for graph_ext.\r\n\r\n* Avoid 'static requirement for GraphMap extensions.\r\n\r\n* Improve docs.\r\n\r\n* Remove dead code.\r\n\r\n* Add release note.\r\n\r\n* Update releasenotes/notes/graph-ext-3f008015c31c592e.yaml\r\n\r\n---------\r\n\r\nCo-authored-by: Matthew Treinish \r\nCo-authored-by: mergify[bot] <37929162+mergify[bot]@users.noreply.github.com>","shortMessageHtmlLink":"Add graph module, port contract_nodes and has_parallel_edges to…"}},{"before":"08601c13077d25645330c0cf768a8ad855d3790f","after":"b3206565319c2d177cde31f1ceba3c431538cbe4","ref":"refs/heads/gh-pages","pushedAt":"2024-05-22T12:15:21.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: c039731294e76395b263d1eaa3c6dba075a87f8f","shortMessageHtmlLink":"deploy: c039731"}},{"before":"3e51301a655021b62b49b0c8934df2b0d26a6e22","after":"c039731294e76395b263d1eaa3c6dba075a87f8f","ref":"refs/heads/main","pushedAt":"2024-05-22T12:06:36.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"},"commit":{"message":"Add hyperbolic random graph model generator (#1196)\n\n* add hyperbolic random graph model generator\r\n\r\n* Loosen trait constraints and simplify structure for longest_path (#1195)\r\n\r\nIn the recently merged #1192 a new generic DAG longest_path function was\r\nadded to rustworkx-core. However, the trait bounds on the function were\r\na bit tighter than they needed to be. The traits were forcing NodeId to\r\nbe of a NodeIndex type and this wasn't really required. The only\r\nrequirement that the NodeId type can be put on a hashmap and do a\r\npartial compare (that implements Hash, Eq, and PartialOrd). Also the\r\nIntoNeighborsDirected wasn't required because it's methods weren't ever\r\nused. This commit loosens the traits bounds to facilitate this. At the\r\nsame time this also simplifies the code structure a bit to reduce the\r\nseparation of the rust code structure in the rustworkx crate using\r\nlongest_path().\r\n\r\n* use vector references\r\n\r\n* change to slice (clippy)\r\n\r\n* generalize to H^D, improve numerical accuracy\r\n\r\n* allow infinite coordinate\r\n\r\n* handle infinity in hyperbolic distance\r\n\r\n* remove unused import (clippy)\r\n\r\n* fix python stub\r\n\r\n---------\r\n\r\nCo-authored-by: Matthew Treinish \r\nCo-authored-by: Ivan Carvalho <8753214+IvanIsCoding@users.noreply.github.com>\r\nCo-authored-by: mergify[bot] <37929162+mergify[bot]@users.noreply.github.com>","shortMessageHtmlLink":"Add hyperbolic random graph model generator (#1196)"}},{"before":"22ee7c6f7333cd44febec50d78ad26308796279c","after":"08601c13077d25645330c0cf768a8ad855d3790f","ref":"refs/heads/gh-pages","pushedAt":"2024-05-22T10:53:58.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: 3e51301a655021b62b49b0c8934df2b0d26a6e22","shortMessageHtmlLink":"deploy: 3e51301"}},{"before":"1df925d17e53c473c094ec2d4204b0bb8ea17f66","after":"3e51301a655021b62b49b0c8934df2b0d26a6e22","ref":"refs/heads/main","pushedAt":"2024-05-22T10:45:44.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"mtreinish","name":"Matthew Treinish","path":"/mtreinish","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/2447371?s=80&v=4"},"commit":{"message":"Add lexicographical_topological_sort function to rustworkx-core (#1197)\n\n* Add lexicographical_topological_sort function to rustworkx-core\r\n\r\nThis commit adds a rust generic implementation of the lexicographical\r\ntopological sort function that was previously only exposed via the\r\npython interface to rustworkx-core. This new function is used internally\r\nby rustworkx and replaces the python specific implementation that used\r\nto be there. But it now exposes an interface to use it to rust.\r\n\r\nFixes: #1165\r\n\r\n* Simplify trait bounds\r\n\r\n* Use .lcov extension for coveralls\r\n\r\n---------\r\n\r\nCo-authored-by: Ivan Carvalho <8753214+IvanIsCoding@users.noreply.github.com>\r\nCo-authored-by: mergify[bot] <37929162+mergify[bot]@users.noreply.github.com>","shortMessageHtmlLink":"Add lexicographical_topological_sort function to rustworkx-core (#1197)"}},{"before":"a24dbddee28783ca902caeaac339cbd7010177b1","after":"22ee7c6f7333cd44febec50d78ad26308796279c","ref":"refs/heads/gh-pages","pushedAt":"2024-05-22T01:18:11.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: 1df925d17e53c473c094ec2d4204b0bb8ea17f66","shortMessageHtmlLink":"deploy: 1df925d"}},{"before":"0ec113b077fc27943947496cbef4f88daed558bf","after":"1df925d17e53c473c094ec2d4204b0bb8ea17f66","ref":"refs/heads/main","pushedAt":"2024-05-22T01:08:55.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"mtreinish","name":"Matthew Treinish","path":"/mtreinish","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/2447371?s=80&v=4"},"commit":{"message":"Fix `coveralls` by changing the extension to `.lcov` (#1198)\n\n* Try to use Coveralls output from grcov\r\n\r\n* Use .lcov extension instead of .info\r\n\r\nThis reverts commit d14e0e74f4d63fe6ec7d030f96881b66661eeeb9.","shortMessageHtmlLink":"Fix coveralls by changing the extension to .lcov (#1198)"}},{"before":"5aa87329d55e8e156dcd4b03545ed9ec2955e919","after":"a24dbddee28783ca902caeaac339cbd7010177b1","ref":"refs/heads/gh-pages","pushedAt":"2024-05-18T12:08:58.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: 0ec113b077fc27943947496cbef4f88daed558bf","shortMessageHtmlLink":"deploy: 0ec113b"}},{"before":"8e8191104ccaea17f7efe4539940b15466dd37c1","after":"0ec113b077fc27943947496cbef4f88daed558bf","ref":"refs/heads/main","pushedAt":"2024-05-18T12:01:05.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"},"commit":{"message":"Loosen trait constraints and simplify structure for longest_path (#1195)\n\nIn the recently merged #1192 a new generic DAG longest_path function was\r\nadded to rustworkx-core. However, the trait bounds on the function were\r\na bit tighter than they needed to be. The traits were forcing NodeId to\r\nbe of a NodeIndex type and this wasn't really required. The only\r\nrequirement that the NodeId type can be put on a hashmap and do a\r\npartial compare (that implements Hash, Eq, and PartialOrd). Also the\r\nIntoNeighborsDirected wasn't required because it's methods weren't ever\r\nused. This commit loosens the traits bounds to facilitate this. At the\r\nsame time this also simplifies the code structure a bit to reduce the\r\nseparation of the rust code structure in the rustworkx crate using\r\nlongest_path().","shortMessageHtmlLink":"Loosen trait constraints and simplify structure for longest_path (#1195)"}},{"before":"00ec35336f5e344bdb916e02764febaae3ea6329","after":"5aa87329d55e8e156dcd4b03545ed9ec2955e919","ref":"refs/heads/gh-pages","pushedAt":"2024-05-16T00:50:04.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: 8e8191104ccaea17f7efe4539940b15466dd37c1","shortMessageHtmlLink":"deploy: 8e81911"}},{"before":"12f8af5edba118f66374211dd1e841cfc0519bad","after":"8e8191104ccaea17f7efe4539940b15466dd37c1","ref":"refs/heads/main","pushedAt":"2024-05-16T00:41:45.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"},"commit":{"message":"Always return a cycle in `digraph_find_cycle` if no node is specified and a cycle exists (#1181)\n\n* Handle find arbitrary cycle case\r\n\r\n* Find node in cycle more smartly\r\n\r\n* Implement find_node_in_arbitrary_cycle\r\n\r\n* Switch to Tarjan SCC for single pass DFS\r\n\r\n* Improve cycle checking logic\r\n\r\n* More assert_cycle!\r\n\r\n* Cargo fmt\r\n\r\n* Add test case for no cycle and no source\r\n\r\n* assertCycle for existing unit tests\r\n\r\n* Add more tests\r\n\r\n* Add self loop Python test\r\n\r\n* Add release notes and fix test\r\n\r\n* Address PR comments\r\n\r\n* Use less traits\r\n\r\n* Update release notes\r\n\r\n---------\r\n\r\nCo-authored-by: mergify[bot] <37929162+mergify[bot]@users.noreply.github.com>","shortMessageHtmlLink":"Always return a cycle in digraph_find_cycle if no node is specified…"}},{"before":"f5210aee789f5cf3e263e9d39523d2ddd4aece30","after":"00ec35336f5e344bdb916e02764febaae3ea6329","ref":"refs/heads/gh-pages","pushedAt":"2024-05-15T22:40:25.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: 12f8af5edba118f66374211dd1e841cfc0519bad","shortMessageHtmlLink":"deploy: 12f8af5"}},{"before":"325839bef78ea7c7ac0547c858d339a1f0023a5e","after":"12f8af5edba118f66374211dd1e841cfc0519bad","ref":"refs/heads/main","pushedAt":"2024-05-15T22:32:06.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"mtreinish","name":"Matthew Treinish","path":"/mtreinish","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/2447371?s=80&v=4"},"commit":{"message":"Move dag longest path functions to rustworkx-core. (#1192)\n\n* Added `longest_path` to rustworkx (needs verification)\r\n\r\nStarted to port `longest_path` to rustworkx by first adding `longest_path.rs` to `rustworkx-core/src/lib/rs`.\r\n\r\nDifferences from the original in `rustworkx/src/dag_algo/longest_path.rs`:\r\n\r\n- Removed Python-specific code: The function no longer uses pyo3 and PyObject. Instead, it uses generic Rust types.\r\n- Type flexibility: The function parameters now accept any type N for nodes, E for edges, and a weight function F that maps edges (represented by their node indices and edge reference) to a weight of type T. This allows the function to work with different graph and edge types.\r\n- Error handling: Instead of returning a Result, it returns an Option to signify failure only in the case of a cycle, which is preemptively checked at the beginning.\r\n- Using Ord and Add: These trait bounds on T allow for ordering and arithmetic, necessary for determining the longest path.\r\n\r\n* Added tests to `rustworkx-core/src/longest_path.rs`\r\n\r\nExplanation of Test Cases:\r\n\r\n- test_empty_graph: Checks that an empty graph returns a path of length zero with no nodes.\r\n- test_single_node: Checks that a graph with a single node returns the node itself with zero path length (since there's no edge).\r\n - test_simple_path: A simple two-node graph with one edge. Tests if the function correctly identifies the longest path.\r\n - test_dag_with_multiple_paths: A Directed Acyclic Graph (DAG) with three nodes and a choice of paths, to test if the function picks the longest one.\r\n- test_graph_with_cycle: Ensures that the function returns None for a graph with a cycle, as longest path calculations should only be done on DAGs.\r\n\r\nThese test can be run with `cargo test` or with `cargo test test_longest_path`\r\n\r\n* Added more detailed function description\r\n\r\nAdded function descriptions and comments to `longest_path.rs`.\r\n\r\nThe function description is based off of the format in `rustworkx-core/src/line_graph`.\r\n\r\n* Style changes\r\n\r\n* Updated longest_path.rs\r\n\r\nSlight optimizations for `longest_path.rs`\r\n\r\n* Changed longest_path to accept any G\r\n\r\nAdjusted the function to accept `G` instead of a `DiGraph` where `G` has the mentioned traits to represent any directed graph. This allows the function to be more general and apply to both `DiGraph` and `StableDiGraph`.\r\n\r\nI also changed some other parts of the code to match the original for consistency.\r\n\r\nHowever, there is a current issue with compiling the tests, as for some reason, the tests do not satisfy the trait `EdgeRef`.\r\n\r\n* Fixed Test Cases and Adjusted Parameters\r\n\r\nAdjusted parameters to that F now represents a function that will pass the `EdgeRef` for the edges in the graph.\r\n\r\nBefore we had an error when passing the `EdgeRef` as a trait of `G`, but it should actually be used for `F`.\r\n\r\nAdjusted the tests to account for that change and added additional tests of StableDiGraph and negative weights.\r\n\r\n* Converted return time to use usize instead of NodeIndex\r\n\r\nConverted the return type from ``Some((Vec, T))`` to `Some((Vec, T))` to match the original function more. May need to change back to `NodeIndex` if it makes more sense to use it, as I can see a couple of cases where that is more ideal.\r\n\r\n* Updated `longest_path` in src to use rustworkx_core\r\n\r\nChanged `longest_path` to call `core_longest_path` (the implementation in rustworkx_core) by creating the `dag` and `edge_cost` parameters for that function.\r\n\r\nHowever, there is an issue of unvalid weights, which I am unsure how to handle at the moment.\r\n\r\nAll tests seem to pass except for `digraph.test_depth.TestWeightedLongestPath.test_nan_not_valid_weight`.\r\n\r\n* Changed the return type for the weight function\r\n\r\nChanged the return type to handle the kind of errors that the weight function can return.\r\n\r\nMade changes so that it is more similar to how we implemented `dijkstra`.\r\n\r\nAdded a small test case for this change.\r\n\r\n* Updated `longest_path.rs` in src to reflect the new type change\r\n\r\nUpdated the edge_cost to return `Result` and updated error handling.\r\n\r\nNow all tests pass.\r\n\r\nAlso updated style and added an example.\r\n\r\n* Added release notes\r\n\r\n* Documentation changes\r\n\r\n* Polish up and slight optimizations\r\n\r\nSummary of Changes:\r\n- Change variable names for clarity: `incoming_path` instead of `us` and `max_path` instead of `maxu`\r\n- Simplified while Loop Condition: Replaced complex match statement with map_or for clearer and more concise logic in the backtracking loop.\r\n- Optimized HashMap Initialization: Pre-allocated HashMap with capacity equal to the number of nodes to improve performance and memory usage.\r\n- Enhanced Maximum Distance Calculation: Used into_iter and unwrap_or to simplify logic and improve readability by directly handling maximum value computation and default cases.\r\n\r\n* Documentation and style\r\n\r\nAdded a function description to `longest_path` in `src/dag_algo/longest_path.rs`\r\n\r\n* Update releasenotes/notes/migrate-longest_path-7c11cf2c8ac9781f.yaml\r\n\r\nCo-authored-by: Matthew Treinish \r\n\r\n* Rename the module to `dag_algo`\r\n\r\nRename `longest_path.rs` to `dag_algo` as the `longest_path` function works only for DAGs and now we can include other DAG function here.\r\n\r\n* Changed return type for the output `Vec`\r\n\r\nChanged the return type from `Some((Vec, T))` to `Some((Vec>, T))`, as it makes it easier for users to use `G::NodeId` (which is the generic form of NodeIndex).\r\n\r\nAlso added aliases for readbility.\r\n\r\n---------\r\n\r\nCo-authored-by: Matthew Treinish ","shortMessageHtmlLink":"Move dag longest path functions to rustworkx-core. (#1192)"}},{"before":"8c960ce35490f43bcbf38e8270f9501ff2782bc3","after":"f5210aee789f5cf3e263e9d39523d2ddd4aece30","ref":"refs/heads/gh-pages","pushedAt":"2024-05-15T17:07:41.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: 325839bef78ea7c7ac0547c858d339a1f0023a5e","shortMessageHtmlLink":"deploy: 325839b"}},{"before":"0e6214f0b38065f176510f39d5a8d9836f90f397","after":null,"ref":"refs/heads/dependabot/cargo/serde-1.0.202","pushedAt":"2024-05-15T16:59:36.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"}},{"before":"9f1d8c7c014c0d6270b4c1275e86e1330b23eef2","after":"325839bef78ea7c7ac0547c858d339a1f0023a5e","ref":"refs/heads/main","pushedAt":"2024-05-15T16:59:36.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"},"commit":{"message":"Bump serde from 1.0.201 to 1.0.202 (#1193)\n\nBumps [serde](https://github.com/serde-rs/serde) from 1.0.201 to 1.0.202.\r\n- [Release notes](https://github.com/serde-rs/serde/releases)\r\n- [Commits](https://github.com/serde-rs/serde/compare/v1.0.201...v1.0.202)\r\n\r\n---\r\nupdated-dependencies:\r\n- dependency-name: serde\r\n dependency-type: direct:production\r\n update-type: version-update:semver-patch\r\n...\r\n\r\nSigned-off-by: dependabot[bot] \r\nCo-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>","shortMessageHtmlLink":"Bump serde from 1.0.201 to 1.0.202 (#1193)"}},{"before":null,"after":"0e6214f0b38065f176510f39d5a8d9836f90f397","ref":"refs/heads/dependabot/cargo/serde-1.0.202","pushedAt":"2024-05-15T14:22:19.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"dependabot[bot]","name":null,"path":"/apps/dependabot","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/29110?s=80&v=4"},"commit":{"message":"Bump serde from 1.0.201 to 1.0.202\n\nBumps [serde](https://github.com/serde-rs/serde) from 1.0.201 to 1.0.202.\n- [Release notes](https://github.com/serde-rs/serde/releases)\n- [Commits](https://github.com/serde-rs/serde/compare/v1.0.201...v1.0.202)\n\n---\nupdated-dependencies:\n- dependency-name: serde\n dependency-type: direct:production\n update-type: version-update:semver-patch\n...\n\nSigned-off-by: dependabot[bot] ","shortMessageHtmlLink":"Bump serde from 1.0.201 to 1.0.202"}},{"before":"7b5704d30f97a30e981e0f131e91177eaa3c070a","after":"8c960ce35490f43bcbf38e8270f9501ff2782bc3","ref":"refs/heads/gh-pages","pushedAt":"2024-05-08T23:31:13.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: 9f1d8c7c014c0d6270b4c1275e86e1330b23eef2","shortMessageHtmlLink":"deploy: 9f1d8c7"}},{"before":"618af0834b054ef7d13176c0a947b6525860aa2f","after":null,"ref":"refs/heads/dependabot/cargo/petgraph-0.6.5","pushedAt":"2024-05-08T23:22:56.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"}},{"before":"b80b11a1e0052bdc64f1ff3a695fc48006895992","after":"9f1d8c7c014c0d6270b4c1275e86e1330b23eef2","ref":"refs/heads/main","pushedAt":"2024-05-08T23:22:55.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"},"commit":{"message":"Bump petgraph from 0.6.4 to 0.6.5 (#1188)\n\nBumps [petgraph](https://github.com/petgraph/petgraph) from 0.6.4 to 0.6.5.\r\n- [Changelog](https://github.com/petgraph/petgraph/blob/master/RELEASES.rst)\r\n- [Commits](https://github.com/petgraph/petgraph/compare/petgraph@v0.6.4...petgraph@v0.6.5)\r\n\r\n---\r\nupdated-dependencies:\r\n- dependency-name: petgraph\r\n dependency-type: direct:production\r\n update-type: version-update:semver-patch\r\n...\r\n\r\nSigned-off-by: dependabot[bot] \r\nCo-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>\r\nCo-authored-by: mergify[bot] <37929162+mergify[bot]@users.noreply.github.com>","shortMessageHtmlLink":"Bump petgraph from 0.6.4 to 0.6.5 (#1188)"}},{"before":"f658f8de7ec43ba9c54f372d5cbacd25824b2931","after":"7b5704d30f97a30e981e0f131e91177eaa3c070a","ref":"refs/heads/gh-pages","pushedAt":"2024-05-08T22:58:26.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: b80b11a1e0052bdc64f1ff3a695fc48006895992","shortMessageHtmlLink":"deploy: b80b11a"}},{"before":"eabd22b5d38372a89f715297f618260fa1a4ec00","after":"618af0834b054ef7d13176c0a947b6525860aa2f","ref":"refs/heads/dependabot/cargo/petgraph-0.6.5","pushedAt":"2024-05-08T22:50:20.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"mergify[bot]","name":null,"path":"/apps/mergify","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/10562?s=80&v=4"},"commit":{"message":"Merge branch 'main' into dependabot/cargo/petgraph-0.6.5","shortMessageHtmlLink":"Merge branch 'main' into dependabot/cargo/petgraph-0.6.5"}},{"before":"9b77a0d29da8b2e421887714e13c1cf8a881bc6b","after":null,"ref":"refs/heads/dependabot/cargo/serde-1.0.201","pushedAt":"2024-05-08T22:49:45.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"}},{"before":"760c4c43cbdd75a2d9db5d33c263e910577e3287","after":"b80b11a1e0052bdc64f1ff3a695fc48006895992","ref":"refs/heads/main","pushedAt":"2024-05-08T22:49:44.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"},"commit":{"message":"Bump serde from 1.0.200 to 1.0.201 (#1190)\n\nBumps [serde](https://github.com/serde-rs/serde) from 1.0.200 to 1.0.201.\r\n- [Release notes](https://github.com/serde-rs/serde/releases)\r\n- [Commits](https://github.com/serde-rs/serde/compare/v1.0.200...v1.0.201)\r\n\r\n---\r\nupdated-dependencies:\r\n- dependency-name: serde\r\n dependency-type: direct:production\r\n update-type: version-update:semver-patch\r\n...\r\n\r\nSigned-off-by: dependabot[bot] \r\nCo-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>\r\nCo-authored-by: mergify[bot] <37929162+mergify[bot]@users.noreply.github.com>","shortMessageHtmlLink":"Bump serde from 1.0.200 to 1.0.201 (#1190)"}},{"before":"6accc0e9711bd72bbab1e1ac131f81ef339c4e78","after":"f658f8de7ec43ba9c54f372d5cbacd25824b2931","ref":"refs/heads/gh-pages","pushedAt":"2024-05-08T22:19:31.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"deploy: 760c4c43cbdd75a2d9db5d33c263e910577e3287","shortMessageHtmlLink":"deploy: 760c4c4"}},{"before":"e1eeaf01834b5d052d067c6bc3e998421e6d977f","after":"9b77a0d29da8b2e421887714e13c1cf8a881bc6b","ref":"refs/heads/dependabot/cargo/serde-1.0.201","pushedAt":"2024-05-08T22:11:58.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"mergify[bot]","name":null,"path":"/apps/mergify","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/10562?s=80&v=4"},"commit":{"message":"Merge branch 'main' into dependabot/cargo/serde-1.0.201","shortMessageHtmlLink":"Merge branch 'main' into dependabot/cargo/serde-1.0.201"}},{"before":"8c7f9c974a3aa2d0cf61c6ea20fae06f665ac896","after":"eabd22b5d38372a89f715297f618260fa1a4ec00","ref":"refs/heads/dependabot/cargo/petgraph-0.6.5","pushedAt":"2024-05-08T22:11:33.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"dependabot[bot]","name":null,"path":"/apps/dependabot","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/29110?s=80&v=4"},"commit":{"message":"Bump petgraph from 0.6.4 to 0.6.5\n\nBumps [petgraph](https://github.com/petgraph/petgraph) from 0.6.4 to 0.6.5.\n- [Changelog](https://github.com/petgraph/petgraph/blob/master/RELEASES.rst)\n- [Commits](https://github.com/petgraph/petgraph/compare/petgraph@v0.6.4...petgraph@v0.6.5)\n\n---\nupdated-dependencies:\n- dependency-name: petgraph\n dependency-type: direct:production\n update-type: version-update:semver-patch\n...\n\nSigned-off-by: dependabot[bot] ","shortMessageHtmlLink":"Bump petgraph from 0.6.4 to 0.6.5"}},{"before":"5a52c5d04616b431c315a3617e81fa393d54169c","after":null,"ref":"refs/heads/dependabot/cargo/serde_json-1.0.117","pushedAt":"2024-05-08T22:10:56.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"}},{"before":"02ef61ee8794ffad30d2200c6928fb8ec2b5b8e7","after":"760c4c43cbdd75a2d9db5d33c263e910577e3287","ref":"refs/heads/main","pushedAt":"2024-05-08T22:10:55.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"IvanIsCoding","name":"Ivan Carvalho","path":"/IvanIsCoding","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8753214?s=80&v=4"},"commit":{"message":"Bump serde_json from 1.0.116 to 1.0.117 (#1187)\n\nBumps [serde_json](https://github.com/serde-rs/json) from 1.0.116 to 1.0.117.\r\n- [Release notes](https://github.com/serde-rs/json/releases)\r\n- [Commits](https://github.com/serde-rs/json/compare/v1.0.116...v1.0.117)\r\n\r\n---\r\nupdated-dependencies:\r\n- dependency-name: serde_json\r\n dependency-type: direct:production\r\n update-type: version-update:semver-patch\r\n...\r\n\r\nSigned-off-by: dependabot[bot] \r\nCo-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>\r\nCo-authored-by: Ivan Carvalho <8753214+IvanIsCoding@users.noreply.github.com>","shortMessageHtmlLink":"Bump serde_json from 1.0.116 to 1.0.117 (#1187)"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEUQWT3wA","startCursor":null,"endCursor":null}},"title":"Activity · Qiskit/rustworkx"}