Re: [PATCH 14/16] bisect: use a modified breadth-first search to find relevant weights

Hi, On 02/26/2016 04:09 AM, Junio C Hamano wrote: > Interesting. So you walk from the bottom commits, incrementing the > weight while walking on a part of the graph that is single strand of > pearls, or doing the "count the reachable ones the hard way" when > you hit a merge [*1*], but either

Re: [PATCH 14/16] bisect: use a modified breadth-first search to find relevant weights

Stephan Beyer writes: > The idea is to reverse the DAG and perform a modified breadth-first search > on it, starting on all sources of the reversed DAG. > Before each visit of a commit, its weight is induced. > This only works for non-merge commits, so the BFS stops prematurely

[PATCH 14/16] bisect: use a modified breadth-first search to find relevant weights

The idea is to reverse the DAG and perform a modified breadth-first search on it, starting on all sources of the reversed DAG. Before each visit of a commit, its weight is induced. This only works for non-merge commits, so the BFS stops prematurely on merge commits (that are collected in a list).