Compute graph rows for an ordered list of commits (topological order, newest first). Each commit must supply its own id and parentIds.
id
parentIds
Topologically sorted commits (newest → oldest).
One GraphRow per commit in the same order.
GraphRow
Compute graph rows for an ordered list of commits (topological order, newest first). Each commit must supply its own
idandparentIds.