Hi!

A multidigraph by definition is a directed graph which is permitted to have multiple edges with the same source and target nodes.
It can also allow loops, however some like to call these pseudographs, reserving the term multigraph for the case with no loops.
Jgrapht is implemented to preseve this distinction.

So to answer your question in short, DirectedPseudograph is the structure you are looking for.

Szabolcs


2014-04-01 0:06 GMT+02:00 Rikless <eric.mermet@gmail.com>:
Hi,

I come back on this post because i had the same problem on an old algorithm
using a DirectedWeightedMultigraph structure.

I know that there is loops on my data, that's why i choosed this structure.
As mentionned in the javadoc :
*DirectedMultigraph* (used by Patricia) : A directed multigraph is a
non-simple directed graph in which loops and multiple edges between any two
vertices are permitted.
*DirectedWeightedMultigraph* : A directed weighted multigraph is a
non-simple directed graph in which loops and multiple edges between any two
vertices are permitted, and edges have weights.

I think something have changed since version 0.9.0.

Any idea ?
What is the structure i can use with loops and multiple edges ?

Rik





--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Label-Edge-Example-tp4024899p4024909.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

------------------------------------------------------------------------------
_______________________________________________
jgrapht-users mailing list
jgrapht-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/jgrapht-users