)]}'
{
  "commit": "9e5fa0fe47185bec25d711db104d0fd6adc69a2a",
  "tree": "2ef396a8b66e38ea7823799a6c385ad9f566e8f8",
  "parents": [
    "3c846063eaefaca4943623f2ad68717068ee31ba"
  ],
  "author": {
    "name": "Yun Peng",
    "email": "pcloudy@google.com",
    "time": "Tue Dec 09 02:20:07 2025 -0800"
  },
  "committer": {
    "name": "seifgamal",
    "email": "seifgamal007@gmail.com",
    "time": "Tue Dec 09 12:15:32 2025 +0100"
  },
  "message": "Fix StackOverflowError in bazel mod graph output\n\nThis change fixes an infinite recursion issue in TextOutputFormatter when the dependency graph contains cycles formed by merging different paths. It adds a parentStack to track visited nodes and detect cycles dynamically.\n\nFixes https://github.com/bazelbuild/bazel/issues/27839\n\nCloses #27876.\n\nPiperOrigin-RevId: 842137415\nChange-Id: I131d3310b1fa939164379a50419f16ebb071ec55\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "a371b38f33bd6b8c4578854a1043b3757fd5ebe4",
      "old_mode": 33188,
      "old_path": "src/main/java/com/google/devtools/build/lib/bazel/bzlmod/modcommand/TextOutputFormatter.java",
      "new_id": "426a025f64082c0334cf8f4ba708669bc28322ad",
      "new_mode": 33188,
      "new_path": "src/main/java/com/google/devtools/build/lib/bazel/bzlmod/modcommand/TextOutputFormatter.java"
    },
    {
      "type": "modify",
      "old_id": "da8c17543afb29e53aa3591e6e5fe68fd5fcb6bf",
      "old_mode": 33188,
      "old_path": "src/test/java/com/google/devtools/build/lib/bazel/bzlmod/modcommand/ModExecutorTest.java",
      "new_id": "5a7d16db4d406f6ecc10c1b4c2e8aa7f97d01dc4",
      "new_mode": 33188,
      "new_path": "src/test/java/com/google/devtools/build/lib/bazel/bzlmod/modcommand/ModExecutorTest.java"
    }
  ]
}
