)]}'
{
  "commit": "9f6147aa0c786fa612d5ceb64b27d26f5618285b",
  "tree": "3464dc74937c65e81b8038dcc132ad20b10b8678",
  "parents": [
    "be5b45e6354410b27a8e4018bbf0e341277bd99d"
  ],
  "author": {
    "name": "MohamedEldafrawy",
    "email": "mohamed.eldafrawy@mail.utoronto.ca",
    "time": "Thu May 23 18:54:47 2019 -0400"
  },
  "committer": {
    "name": "MohamedEldafrawy",
    "email": "mohamed.eldafrawy@mail.utoronto.ca",
    "time": "Fri May 24 13:11:15 2019 -0400"
  },
  "message": "vpr: Making the search for transitive connectivity candidates more\nefficient.\n\nOnly look at nets that still have pins outside of the current\nclusters. Since there is no point of looking at nets that are totally\nabsorbed into the cluster.\n\nWhen searching for transitive candidates, search within a certain CLB\nonly once, since all candidates from this CLB will be added from\nthe first time.\n\nAlso, Instead of constraining the net size to explore, constrain the number\nof CLBs to explore for each net. Since this is the time consuming part\nof the code.\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "8e22bac34a271c74dce8fc48bb79ff8f2773530a",
      "old_mode": 33188,
      "old_path": "vpr/src/pack/cluster.cpp",
      "new_id": "6e7fb1482dbeee8e07875ba69c5c234c2992c708",
      "new_mode": 33188,
      "new_path": "vpr/src/pack/cluster.cpp"
    },
    {
      "type": "modify",
      "old_id": "51186466e5c006bb391907a5d7335409ba5b0507",
      "old_mode": 33188,
      "old_path": "vpr/src/pack/pack_types.h",
      "new_id": "9b13c53460203828c86514092b8b1d69c4f9325d",
      "new_mode": 33188,
      "new_path": "vpr/src/pack/pack_types.h"
    }
  ]
}