Hi all, my name is Michele Caini, I write from Italy, Florence, and this is my first mail on this list. I'd like to propose a new generic implementation of the two-graphs common three algorithm, proposed first by Grimbleby and then modified by Schach, that made a revolution on the first idea basing his algorithm on the solution for the single spanning three problem proposed and developed by Mint, Read and Tarjan. This algorithm is mainly used in symbolic circuit analysis, and I develop a generic solution for my symbolic solutor: QSapecNG, Qt-based frontend for symbolic circuit solution. If Boost Graph library mantainers are interested on publishing this algorithm with the next release of library, I'm happy to submit it, and to work on to optimize the code. Thanks to all, Michele ps: sorry for my English. :-)