git/list[1] front-page[2] threads[3] people[4] search[5] about
 

Shortest path between commits

From
RBRalf Baechle <ralf@linux-mips.org>
Date
Feb 8, 2006, 16:03 UTC
Message-ID
<20060208160308.GB3484@linux-mips.org>

I wonder if there some way to find the shortest path between two commits? That is if there is a merge between the two commits I only want the merge commit itself, not the potencially large list of commits that were merged.

I need that for commit notification scripts; I don't want to spam users with too many emails and aggregating everything that came through a single merge would be a reaonsable approach.

  Ralf
Next: Linus Torvalds
Message 1 of 2 in “Shortest path between commits”
  1. Ralf BaechleFeb 8, 2006
  2. Linus TorvaldsFeb 8, 2006

Read the whole thread, see it on lore, or plain text.

$ cat FOOTERMessages come from the public archive at lore.kernel.org/git, fetched every hour. The front page is chosen and written each morning by an AI editor and can be wrong; the threads themselves are the record. About and API. For agents: an MCP server at https://gitlist.dev/mcp, and any thread, story or person page as Markdown by adding .md to its URL (or sending Accept: text/markdown). Details in /llms.txt.