Re: [jgrapht-users] Composition and inverse of a graph

[J K. <j.k...@gm...>]

I have no idea about whether you should use Jung or jgrapht, but as far as
I know, development of Jung stopped several years ago.

1. Check existence of a path between two vertices.
Use of of the (many) shortest path algorithms, or a connectivity inspector.

2. Invert (replace every edge with the opposite edge) a directed graph.
Use http://jgrapht.org/javadoc/org/jgrapht/graph/EdgeReversedGraph.html

3. No idea what you want.

br,

Joris Kinable


On Wed, Dec 27, 2017 at 1:27 PM, Victor Porton <po...@na...> wrote:

> I am implementing this ambitious free software in Java:
>
> https://en.wikiversity.org/wiki/Automatic_transformation_of_XML_namespaces
>
> 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.
>
> ------------------------------------------------------------
> ------------------
> Check out the vibrant tech community on one of the world's most
> engaging tech sites, Slashdot.org! http://sdm.link/slashdot
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>