Commit Briefs
rename got_commit_graph_iter_start() to got_commit_graph_bfsort()
This function begins a breadth-first traversal. The new name makes it easier to distinguish from got_commit_graph_toposort().
make 'got rebase' find a merge base with topological sorting if needed
Fixes a problematic case of spurious conflicts encountered by naddy@ on landry's firefox package git repository. The current implementation of toposort is expensive, so this might make rebase appear to run slowly on large repositories. However, this is better than letting users deal with spurious conflicts. ok op@
add support for topological sorting to the commit graph
The algorithm implemented here is based on a description I read on github's blog. See code comments for details. ok op@
make got_commit_graph_iter_next use caller-provided storage for the id
and adjust the callers. discussed with and ok stsp@
remove got_commit_graph_contains_object()
Put equivalent functionality into fetch_commits_up_to() instead.