Merge Algorithm

GSoC-16 "Multiversion"-Coding period - Week 3

Submitted by rakesh on Tue, 06/14/2016 - 18:31

Background Information: We needed a PHP Library for our project which could return the Lowest Common Ancestor (LCA) from a Directed Acyclic Graph (DAG). This LCA would act as a base node for our Remote and Local nodes and the nodes will be compared with this LCA to detect a conflict otherwise merge. For more details about the project, please refer to this page. Let's take a look at the detailed description of the problem as well as the approach we are working on.