GraphStream Users

Archives de la liste Aide

Re: Induced graph

Chronologique Discussions 
  • From: Stefan Balev <stefan.balev AT>
  • To: "graphstream-users AT" <graphstream-users AT>, Mauricio Chiazzaro <Mauricio.Chiazzaro AT>
  • Subject: Re: Induced graph
  • Date: Tue, 29 Jul 2014 19:41:27 +0200

Hello and thank you for using GraphStream.

To compute the union of two (ore more) graphs you can use the methods merge or mergeIn defined in org.graphstream.graph.implementations.Graphs class

There is no direct method to compute an induced graph as far as I know but it is not difficult to code one. Maybe the simplest way is to clone your graph and to remove the nodes that do not belong to the set.

Hope this helps,


2014-07-28 20:04 GMT+02:00 Mauricio Chiazzaro <Mauricio.Chiazzaro AT>:


Recently looking for libraries to work with graphs, I came across GraphStream and I get very impressed with it. During my explorations, I found it has a lot of useful utilities to work with graphs.

However, I did not find some utilities that would be very useful in my work. And before to start to code it by my self, I would like to know if there exists in the library some method to calculate: the union of two graphs, and the induced graph of a set of nodes in a graph.

There exists in the API some methods to do these kind of operations?

Thank you.






Archives gérées par MHonArc 2.6.16.

Top of page