jgrapht-users

[jgrapht-users] Mixed graphs

[krutor <mat...@gm...>]

Hi, I'm considering using JGraphT as general graphstore in my project, but I
need to represent graph as Mixed graph
(http://mathworld.wolfram.com/MixedGraph.html) - using directed and
undirected edges together in  one graph. Is there any way to simulate this
behaviour in JGraphT?

The best I came up with yet, is to hide JGraphT behind my own interface, use
custom edges with DIRECTED flag and undirected graph implementation
overriding methods behavior where needed. When using algorithms, it is
usually ok for me that graph is treated like undirected, so I will just use
them with the underlying undirected graph...

Cleaner implementation may be implementing my own
AbstractBaseGraph.Specifics, but that is impossible to do since Specifics
class is private. Is there any special reason for it to be private? 

Is there any better way to do it? Am I missing something important?

Thanks for response




--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Mixed-graphs-tp4024952.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

Re: [jgrapht-users] Mixed graphs

[Dimitris M. <dma...@cs...>]

This is a more general answer and applies to any graph implementation. 
It is often used in situations such as the one you describe.

You can use a directed graph and simply represent any undirected edge 
with two directed edges. So, if you have an undirected edge between node 
A and node B, you would create an edge from node A to node B and another 
from node B to node A.

If you think of it, an undirected graph is a generalization of a 
directed graph containing both directions between nodes.

Dimitris

On 08/01/2015 11:50 πμ, krutor wrote:
> Hi, I'm considering using JGraphT as general graphstore in my project, but I
> need to represent graph as Mixed graph
> (http://mathworld.wolfram.com/MixedGraph.html) - using directed and
> undirected edges together in  one graph. Is there any way to simulate this
> behaviour in JGraphT?
>
> The best I came up with yet, is to hide JGraphT behind my own interface, use
> custom edges with DIRECTED flag and undirected graph implementation
> overriding methods behavior where needed. When using algorithms, it is
> usually ok for me that graph is treated like undirected, so I will just use
> them with the underlying undirected graph...
>
> Cleaner implementation may be implementing my own
> AbstractBaseGraph.Specifics, but that is impossible to do since Specifics
> class is private. Is there any special reason for it to be private?
>
> Is there any better way to do it? Am I missing something important?
>
> Thanks for response
>
>
>
>
> --
> View this message in context: http://jgrapht-users.107614.n3.nabble.com/Mixed-graphs-tp4024952.html
> Sent from the jgrapht-users mailing list archive at Nabble.com.
>
> ------------------------------------------------------------------------------
> Dive into the World of Parallel Programming! The Go Parallel Website,
> sponsored by Intel and developed in partnership with Slashdot Media, is your
> hub for all things parallel software development, from weekly thought
> leadership blogs to news, videos, case studies, tutorials and more. Take a
> look and join the conversation now. http://goparallel.sourceforge.net
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users

Re: [jgrapht-users] Mixed graphs

[Matyas K. <mat...@gm...>]

Thank you for your response, but unfortunately this is not applicable for
me since I have to distinguish between cases where there are actually two
directed edges with opposite direction between two nodes and where there is
an undirected edge. I would have to keep track of undirected edges
somewhere and treat both directed edges which forms the undirected edge as
one when changing some property or removing the edge. This seems more
difficult and error-prone then creating a sort of "semidirected view" over
undirected graph as I suggested...

2015-01-08 12:26 GMT+01:00 Dimitris Mavroeidis <dma...@cs...>:

> This is a more general answer and applies to any graph implementation. It
> is often used in situations such as the one you describe.
>
> You can use a directed graph and simply represent any undirected edge with
> two directed edges. So, if you have an undirected edge between node A and
> node B, you would create an edge from node A to node B and another from
> node B to node A.
>
> If you think of it, an undirected graph is a generalization of a directed
> graph containing both directions between nodes.
>
> Dimitris
>
> On 08/01/2015 11:50 πμ, krutor wrote:
>
>> Hi, I'm considering using JGraphT as general graphstore in my project,
>> but I
>> need to represent graph as Mixed graph
>> (http://mathworld.wolfram.com/MixedGraph.html) - using directed and
>> undirected edges together in  one graph. Is there any way to simulate this
>> behaviour in JGraphT?
>>
>> The best I came up with yet, is to hide JGraphT behind my own interface,
>> use
>> custom edges with DIRECTED flag and undirected graph implementation
>> overriding methods behavior where needed. When using algorithms, it is
>> usually ok for me that graph is treated like undirected, so I will just
>> use
>> them with the underlying undirected graph...
>>
>> Cleaner implementation may be implementing my own
>> AbstractBaseGraph.Specifics, but that is impossible to do since Specifics
>> class is private. Is there any special reason for it to be private?
>>
>> Is there any better way to do it? Am I missing something important?
>>
>> Thanks for response
>>
>>
>>
>>
>> --
>> View this message in context: http://jgrapht-users.107614.
>> n3.nabble.com/Mixed-graphs-tp4024952.html
>> Sent from the jgrapht-users mailing list archive at Nabble.com.
>>
>> ------------------------------------------------------------
>> ------------------
>> Dive into the World of Parallel Programming! The Go Parallel Website,
>> sponsored by Intel and developed in partnership with Slashdot Media, is
>> your
>> hub for all things parallel software development, from weekly thought
>> leadership blogs to news, videos, case studies, tutorials and more. Take a
>> look and join the conversation now. http://goparallel.sourceforge.net
>> _______________________________________________
>> jgrapht-users mailing list
>> jgr...@li...
>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>
>
>

Re: [jgrapht-users] Mixed graphs

[Luc H. <luc...@in...>]

Having 2 directed edge objects representing the same single undirected edge implies that the data associated to the edge is duplicated (for example its weight). Doing this then imposes to make sure that such duplication is always consistent!

--
Luc Hogie
COMRED Research Unit (I3S(CNRS-UNS) INRIA)
I3S Laboratory, University of Nice Sophia Antipolis

http://www-sop.inria.fr/members/Luc.Hogie/
luc...@cn...
+33 4 89 73 24 25 (office)
+33 6 80 91 40 71 (mobile)


----- Mail original -----
> De: "Dimitris Mavroeidis" <dma...@cs...>
> À: "krutor" <mat...@gm...>, jgr...@li...
> Envoyé: Jeudi 8 Janvier 2015 12:26:50
> Objet: Re: [jgrapht-users] Mixed graphs
> 
> This is a more general answer and applies to any graph implementation.
> It is often used in situations such as the one you describe.
> 
> You can use a directed graph and simply represent any undirected edge
> with two directed edges. So, if you have an undirected edge between node
> A and node B, you would create an edge from node A to node B and another
> from node B to node A.
> 
> If you think of it, an undirected graph is a generalization of a
> directed graph containing both directions between nodes.
> 
> Dimitris
> 
> On 08/01/2015 11:50 πμ, krutor wrote:
> > Hi, I'm considering using JGraphT as general graphstore in my project, but
> > I
> > need to represent graph as Mixed graph
> > (http://mathworld.wolfram.com/MixedGraph.html) - using directed and
> > undirected edges together in  one graph. Is there any way to simulate this
> > behaviour in JGraphT?
> >
> > The best I came up with yet, is to hide JGraphT behind my own interface,
> > use
> > custom edges with DIRECTED flag and undirected graph implementation
> > overriding methods behavior where needed. When using algorithms, it is
> > usually ok for me that graph is treated like undirected, so I will just use
> > them with the underlying undirected graph...
> >
> > Cleaner implementation may be implementing my own
> > AbstractBaseGraph.Specifics, but that is impossible to do since Specifics
> > class is private. Is there any special reason for it to be private?
> >
> > Is there any better way to do it? Am I missing something important?
> >
> > Thanks for response
> >
> >
> >
> >
> > --
> > View this message in context:
> > http://jgrapht-users.107614.n3.nabble.com/Mixed-graphs-tp4024952.html
> > Sent from the jgrapht-users mailing list archive at Nabble.com.
> >
> > ------------------------------------------------------------------------------
> > Dive into the World of Parallel Programming! The Go Parallel Website,
> > sponsored by Intel and developed in partnership with Slashdot Media, is
> > your
> > hub for all things parallel software development, from weekly thought
> > leadership blogs to news, videos, case studies, tutorials and more. Take a
> > look and join the conversation now. http://goparallel.sourceforge.net
> > _______________________________________________
> > jgrapht-users mailing list
> > jgr...@li...
> > https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> 
> 
> ------------------------------------------------------------------------------
> Dive into the World of Parallel Programming! The Go Parallel Website,
> sponsored by Intel and developed in partnership with Slashdot Media, is your
> hub for all things parallel software development, from weekly thought
> leadership blogs to news, videos, case studies, tutorials and more. Take a
> look and join the conversation now. http://goparallel.sourceforge.net
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

Re: [jgrapht-users] Mixed graphs

[H.N. de R. <hnr...@gr...>]

On Thu, Jan 08, 2015 at 12:41:41PM +0100, Matyas Krutsky wrote:

Maybe it is possible to use a GraphUnion of a directed and an undirected graph?

> Thank you for your response, but unfortunately this is not applicable for
> me since I have to distinguish between cases where there are actually two
> directed edges with opposite direction between two nodes and where there is
> an undirected edge. I would have to keep track of undirected edges
> somewhere and treat both directed edges which forms the undirected edge as
> one when changing some property or removing the edge. This seems more
> difficult and error-prone then creating a sort of "semidirected view" over
> undirected graph as I suggested...
> 
> 2015-01-08 12:26 GMT+01:00 Dimitris Mavroeidis <dma...@cs...>:
> 
> > This is a more general answer and applies to any graph implementation. It
> > is often used in situations such as the one you describe.
> >
> > You can use a directed graph and simply represent any undirected edge with
> > two directed edges. So, if you have an undirected edge between node A and
> > node B, you would create an edge from node A to node B and another from
> > node B to node A.
> >
> > If you think of it, an undirected graph is a generalization of a directed
> > graph containing both directions between nodes.
> >
> > Dimitris
> >
> > On 08/01/2015 11:50 πμ, krutor wrote:
> >
> >> Hi, I'm considering using JGraphT as general graphstore in my project,
> >> but I
> >> need to represent graph as Mixed graph
> >> (http://mathworld.wolfram.com/MixedGraph.html) - using directed and
> >> undirected edges together in  one graph. Is there any way to simulate this
> >> behaviour in JGraphT?
> >>
> >> The best I came up with yet, is to hide JGraphT behind my own interface,
> >> use
> >> custom edges with DIRECTED flag and undirected graph implementation
> >> overriding methods behavior where needed. When using algorithms, it is
> >> usually ok for me that graph is treated like undirected, so I will just
> >> use
> >> them with the underlying undirected graph...
> >>
> >> Cleaner implementation may be implementing my own
> >> AbstractBaseGraph.Specifics, but that is impossible to do since Specifics
> >> class is private. Is there any special reason for it to be private?
> >>
> >> Is there any better way to do it? Am I missing something important?
> >>
> >> Thanks for response
> >>
> >>
> >>
> >>
> >> --
> >> View this message in context: http://jgrapht-users.107614.
> >> n3.nabble.com/Mixed-graphs-tp4024952.html
> >> Sent from the jgrapht-users mailing list archive at Nabble.com.
> >>
> >> ------------------------------------------------------------
> >> ------------------
> >> Dive into the World of Parallel Programming! The Go Parallel Website,
> >> sponsored by Intel and developed in partnership with Slashdot Media, is
> >> your
> >> hub for all things parallel software development, from weekly thought
> >> leadership blogs to news, videos, case studies, tutorials and more. Take a
> >> look and join the conversation now. http://goparallel.sourceforge.net
> >> _______________________________________________
> >> jgrapht-users mailing list
> >> jgr...@li...
> >> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> >>
> >
> >

> ------------------------------------------------------------------------------
> Dive into the World of Parallel Programming! The Go Parallel Website,
> sponsored by Intel and developed in partnership with Slashdot Media, is your
> hub for all things parallel software development, from weekly thought
> leadership blogs to news, videos, case studies, tutorials and more. Take a
> look and join the conversation now. http://goparallel.sourceforge.net

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


-- 
Information System on Graph Classes and their Inclusions (ISGCI)
http://www.graphclasses.org

Re: [jgrapht-users] Mixed graphs

[krutor <mat...@gm...>]

Thanks for your suggestion, GraphUnion (or simmilar class) of one directed
graph and one undirected graph surely looks promissing. The only problem I
see is that the resulting union would have to act like a Directed graph, so
it could be a bit tricky to fake this behaviour properly with undirected
edges...

2015-01-08 21:55 GMT+01:00 H.N. de Ridder [via jgrapht-users] <
ml-...@n3...>:

> On Thu, Jan 08, 2015 at 12:41:41PM +0100, Matyas Krutsky wrote:
>
> Maybe it is possible to use a GraphUnion of a directed and an undirected
> graph?
>
> > Thank you for your response, but unfortunately this is not applicable
> for
> > me since I have to distinguish between cases where there are actually
> two
> > directed edges with opposite direction between two nodes and where there
> is
> > an undirected edge. I would have to keep track of undirected edges
> > somewhere and treat both directed edges which forms the undirected edge
> as
> > one when changing some property or removing the edge. This seems more
> > difficult and error-prone then creating a sort of "semidirected view"
> over
> > undirected graph as I suggested...
> >
> > 2015-01-08 12:26 GMT+01:00 Dimitris Mavroeidis <[hidden email]
> <http:///user/SendEmail.jtp?type=node&node=4024956&i=0>>:
> >
> > > This is a more general answer and applies to any graph implementation.
> It
> > > is often used in situations such as the one you describe.
> > >
> > > You can use a directed graph and simply represent any undirected edge
> with
> > > two directed edges. So, if you have an undirected edge between node A
> and
> > > node B, you would create an edge from node A to node B and another
> from
> > > node B to node A.
> > >
> > > If you think of it, an undirected graph is a generalization of a
> directed
> > > graph containing both directions between nodes.
> > >
> > > Dimitris
> > >
> > > On 08/01/2015 11:50 πμ, krutor wrote:
> > >
> > >> Hi, I'm considering using JGraphT as general graphstore in my
> project,
> > >> but I
> > >> need to represent graph as Mixed graph
> > >> (http://mathworld.wolfram.com/MixedGraph.html) - using directed and
> > >> undirected edges together in  one graph. Is there any way to simulate
> this
> > >> behaviour in JGraphT?
> > >>
> > >> The best I came up with yet, is to hide JGraphT behind my own
> interface,
> > >> use
> > >> custom edges with DIRECTED flag and undirected graph implementation
> > >> overriding methods behavior where needed. When using algorithms, it
> is
> > >> usually ok for me that graph is treated like undirected, so I will
> just
> > >> use
> > >> them with the underlying undirected graph...
> > >>
> > >> Cleaner implementation may be implementing my own
> > >> AbstractBaseGraph.Specifics, but that is impossible to do since
> Specifics
> > >> class is private. Is there any special reason for it to be private?
> > >>
> > >> Is there any better way to do it? Am I missing something important?
> > >>
> > >> Thanks for response
> > >>
> > >>
> > >>
> > >>
> > >> --
> > >> View this message in context: http://jgrapht-users.107614.
> > >> n3.nabble.com/Mixed-graphs-tp4024952.html
> > >> Sent from the jgrapht-users mailing list archive at Nabble.com.
> > >>
> > >> ------------------------------------------------------------
> > >> ------------------
> > >> Dive into the World of Parallel Programming! The Go Parallel Website,
> > >> sponsored by Intel and developed in partnership with Slashdot Media,
> is
> > >> your
> > >> hub for all things parallel software development, from weekly thought
> > >> leadership blogs to news, videos, case studies, tutorials and more.
> Take a
> > >> look and join the conversation now. http://goparallel.sourceforge.net
> > >> _______________________________________________
> > >> jgrapht-users mailing list
> > >> [hidden email]
> <http:///user/SendEmail.jtp?type=node&node=4024956&i=1>
> > >> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> > >>
> > >
> > >
>
> >
> ------------------------------------------------------------------------------
>
> > Dive into the World of Parallel Programming! The Go Parallel Website,
> > sponsored by Intel and developed in partnership with Slashdot Media, is
> your
> > hub for all things parallel software development, from weekly thought
> > leadership blogs to news, videos, case studies, tutorials and more. Take
> a
> > look and join the conversation now. http://goparallel.sourceforge.net
>
> > _______________________________________________
> > jgrapht-users mailing list
> > [hidden email] <http:///user/SendEmail.jtp?type=node&node=4024956&i=2>
> > https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>
> --
> Information System on Graph Classes and their Inclusions (ISGCI)
> http://www.graphclasses.org
>
> ------------------------------------------------------------------------------
>
> Dive into the World of Parallel Programming! The Go Parallel Website,
> sponsored by Intel and developed in partnership with Slashdot Media, is
> your
> hub for all things parallel software development, from weekly thought
> leadership blogs to news, videos, case studies, tutorials and more. Take a
> look and join the conversation now. http://goparallel.sourceforge.net
> _______________________________________________
> jgrapht-users mailing list
> [hidden email] <http:///user/SendEmail.jtp?type=node&node=4024956&i=3>
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>
> ------------------------------
>  If you reply to this email, your message will be added to the discussion
> below:
>
> http://jgrapht-users.107614.n3.nabble.com/Mixed-graphs-tp4024952p4024956.html
>  To unsubscribe from Mixed graphs, click here
> <http://jgrapht-users.107614.n3.nabble.com/template/NamlServlet.jtp?macro=unsubscribe_by_code&node=4024952&code=bWF0eWFzLmtydXRza3lAZ21haWwuY29tfDQwMjQ5NTJ8MTE3ODc3Njc1NQ==>
> .
> NAML
> <http://jgrapht-users.107614.n3.nabble.com/template/NamlServlet.jtp?macro=macro_viewer&id=instant_html%21nabble%3Aemail.naml&base=nabble.naml.namespaces.BasicNamespace-nabble.view.web.template.NabbleNamespace-nabble.naml.namespaces.BasicNamespace-nabble.view.web.template.NabbleNamespace-nabble.naml.namespaces.BasicNamespace-nabble.view.web.template.NabbleNamespace-nabble.view.web.template.NodeNamespace&breadcrumbs=notify_subscribers%21nabble%3Aemail.naml-instant_emails%21nabble%3Aemail.naml-send_instant_email%21nabble%3Aemail.naml>
>




--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Mixed-graphs-tp4024952p4024957.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

Re: [jgrapht-users] Mixed graphs

[Dimitris M. <dma...@cs...>]

I 'm entirely sure that the formulation of your problem requires that 
both directed and undirected edges have to exist in the same graph. 
However, sometimes, whenever there is such a requirement, it is 
advisable to go back to the problem and consider whether its model 
really requires both kinds of edges.

If, after reconsidering the problem, it is still absolutely necessary to 
have both kind of edges, consider whether the operations you perform on 
the graph require both kinds of edges. If they do, you could built two 
different graphs (1 directed, 1 undirected) with the same set of nodes, 
but a different set of edges and adapt your operations to check both 
graphs.

Hope that helps a bit.



On 08/01/2015 01:41 μμ, Matyas Krutsky wrote:
> Thank you for your response, but unfortunately this is not applicable 
> for me since I have to distinguish between cases where there are 
> actually two directed edges with opposite direction between two nodes 
> and where there is an undirected edge. I would have to keep track of 
> undirected edges somewhere and treat both directed edges which forms 
> the undirected edge as one when changing some property or removing the 
> edge. This seems more difficult and error-prone then creating a sort 
> of "semidirected view" over undirected graph as I suggested...
>
> 2015-01-08 12:26 GMT+01:00 Dimitris Mavroeidis <dma...@cs... 
> <mailto:dma...@cs...>>:
>
>     This is a more general answer and applies to any graph
>     implementation. It is often used in situations such as the one you
>     describe.
>
>     You can use a directed graph and simply represent any undirected
>     edge with two directed edges. So, if you have an undirected edge
>     between node A and node B, you would create an edge from node A to
>     node B and another from node B to node A.
>
>     If you think of it, an undirected graph is a generalization of a
>     directed graph containing both directions between nodes.
>
>     Dimitris
>
>     On 08/01/2015 11:50 πμ, krutor wrote:
>
>         Hi, I'm considering using JGraphT as general graphstore in my
>         project, but I
>         need to represent graph as Mixed graph
>         (http://mathworld.wolfram.com/MixedGraph.html) - using
>         directed and
>         undirected edges together in  one graph. Is there any way to
>         simulate this
>         behaviour in JGraphT?
>
>         The best I came up with yet, is to hide JGraphT behind my own
>         interface, use
>         custom edges with DIRECTED flag and undirected graph
>         implementation
>         overriding methods behavior where needed. When using
>         algorithms, it is
>         usually ok for me that graph is treated like undirected, so I
>         will just use
>         them with the underlying undirected graph...
>
>         Cleaner implementation may be implementing my own
>         AbstractBaseGraph.Specifics, but that is impossible to do
>         since Specifics
>         class is private. Is there any special reason for it to be
>         private?
>
>         Is there any better way to do it? Am I missing something
>         important?
>
>         Thanks for response
>
>
>
>
>         --
>         View this message in context:
>         http://jgrapht-users.107614.n3.nabble.com/Mixed-graphs-tp4024952.html
>         Sent from the jgrapht-users mailing list archive at Nabble.com.
>
>         ------------------------------------------------------------------------------
>         Dive into the World of Parallel Programming! The Go Parallel
>         Website,
>         sponsored by Intel and developed in partnership with Slashdot
>         Media, is your
>         hub for all things parallel software development, from weekly
>         thought
>         leadership blogs to news, videos, case studies, tutorials and
>         more. Take a
>         look and join the conversation now.
>         http://goparallel.sourceforge.net
>         _______________________________________________
>         jgrapht-users mailing list
>         jgr...@li...
>         <mailto:jgr...@li...>
>         https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>
>

Re: [jgrapht-users] Mixed graphs

[Rushang K. <rus...@ho...>]

Hi,
 
The solution proposed by Dimitris could tax your memory if the graph was large. However it is the most easiest solution to implement.
 
What algorithms do you want to run on the graph? Perhaps then it would be more clearer for us to help you.
 
If you are going to develop some of your own algorithms (that suit your problem) let us know those too.
 
Date: Fri, 9 Jan 2015 19:38:05 +0200
From: dma...@cs...
To: mat...@gm...
CC: jgr...@li...
Subject: Re: [jgrapht-users] Mixed graphs


  
    
  
  
    I 'm entirely sure that the formulation of your problem requires
    that both directed and undirected edges have to exist in the same
    graph. However, sometimes, whenever there is such a requirement, it
    is advisable to go back to the problem and consider whether its
    model really requires both kinds of edges. 

    

    If, after reconsidering the problem, it is still absolutely
    necessary to have both kind of edges, consider whether the
    operations you perform on the graph require both kinds of edges. If
    they do, you could built two different graphs (1 directed, 1
    undirected) with the same set of nodes, but a different set of edges
    and adapt your operations to check both graphs. 

    

    Hope that helps a bit.

    

    

    

    On 08/01/2015 01:41 μμ, Matyas Krutsky
      wrote:

    
    
      Thank you for your response, but unfortunately this
        is not applicable for me since I have to distinguish between
        cases where there are actually two directed edges with opposite
        direction between two nodes and where there is an undirected
        edge. I would have to keep track of undirected edges somewhere
        and treat both directed edges which forms the undirected edge as
        one when changing some property or removing the edge. This seems
        more difficult and error-prone then creating a sort of
        "semidirected view" over undirected graph as I suggested... 
      

        2015-01-08 12:26 GMT+01:00 Dimitris
          Mavroeidis <dma...@cs...>:

          This is a
            more general answer and applies to any graph implementation.
            It is often used in situations such as the one you describe.

            

            You can use a directed graph and simply represent any
            undirected edge with two directed edges. So, if you have an
            undirected edge between node A and node B, you would create
            an edge from node A to node B and another from node B to
            node A.

            

            If you think of it, an undirected graph is a generalization
            of a directed graph containing both directions between
            nodes.

            

            Dimitris

            

            On 08/01/2015 11:50 πμ, krutor wrote:

            
              Hi, I'm considering using JGraphT as general graphstore in
              my project, but I

              need to represent graph as Mixed graph

              (http://mathworld.wolfram.com/MixedGraph.html)
              - using directed and

              undirected edges together in  one graph. Is there any way
              to simulate this

              behaviour in JGraphT?

              

              The best I came up with yet, is to hide JGraphT behind my
              own interface, use

              custom edges with DIRECTED flag and undirected graph
              implementation

              overriding methods behavior where needed. When using
              algorithms, it is

              usually ok for me that graph is treated like undirected,
              so I will just use

              them with the underlying undirected graph...

              

              Cleaner implementation may be implementing my own

              AbstractBaseGraph.Specifics, but that is impossible to do
              since Specifics

              class is private. Is there any special reason for it to be
              private?

              

              Is there any better way to do it? Am I missing something
              important?

              

              Thanks for response

              

              

              

              

              --

              View this message in context: http://jgrapht-users.107614.n3.nabble.com/Mixed-graphs-tp4024952.html

              Sent from the jgrapht-users mailing list archive at
              Nabble.com.

              

              ------------------------------------------------------------------------------

              Dive into the World of Parallel Programming! The Go
              Parallel Website,

              sponsored by Intel and developed in partnership with
              Slashdot Media, is your

              hub for all things parallel software development, from
              weekly thought

              leadership blogs to news, videos, case studies, tutorials
              and more. Take a

              look and join the conversation now. http://goparallel.sourceforge.net

              _______________________________________________

              jgrapht-users mailing list

              jgr...@li...

              https://lists.sourceforge.net/lists/listinfo/jgrapht-users

            
            

          
        
        

      
    
    

  


------------------------------------------------------------------------------
Dive into the World of Parallel Programming! The Go Parallel Website,
sponsored by Intel and developed in partnership with Slashdot Media, is your
hub for all things parallel software development, from weekly thought
leadership blogs to news, videos, case studies, tutorials and more. Take a
look and join the conversation now. http://goparallel.sourceforge.net
_______________________________________________
jgrapht-users mailing list
jgr...@li...
https://lists.sourceforge.net/lists/listinfo/jgrapht-users