From: Victor P. <po...@na...> - 2017-12-27 18:48:03
|
I am implementing this ambitious free software in Java: https://en.wikiversity.org/wiki/Automatic_transformation_of_XML_namespa ces I need a graph library. I am now choosing JUNG vs JGraphT. Now I have the following requirements: 1. Check existence of a path between two vertices. 2. Invert (replace every edge with the opposite edge) a directed graph. 3. Calculate "mathematical" relational composition of two binary relations represented as directed graphs. My requirements may expand in the future. Please explain how to do each of my requirements in both JUNG and JGraphT and help to choose between these two. Thanks in advance. |