363
363
# we need to do a check late in the process to detect end-of-merges
364
364
# which requires the parents to be accessible: its easier for now
365
365
# to just keep the original graph around.
367
367
# we need to know the revision numbers of revisions to determine
368
368
# the revision numbers of their descendants
369
369
# this is a graph from node to [revno_tuple, first_child]