Hi, I'm working on some graph algorithms that I thought might be useful additions to Boost.Graph, such as the classic LCA and more recent lowest single common ancestor (LSCA) [1]. Is there interest in having these added? I saw there was some discussion of LCA between Cromwell Enage and others back in 2004 but I'm unaware of the outcome (in terms of proposed code, etc). Cheers. Jeremy [1] https://github.com/jeremy-murphy/graph-algorithms