|
From: Gábor S. <gab...@gm...> - 2023-10-04 18:31:50
|
Hello Siddharth, Can you please describe it a little bit more? If you have a Kn complete Graph, and you remove a Vertex (and all the edges related to that vertex) you gonna still have a complete graph with Kn-1 nodes. Kind regards, Gábor Siddharth Jain <sid...@gm...> ezt írta (időpont: 2023. okt. 4., Sze, 20:25): > Hello, > > I have a SimpleGraph that is fully connected. I need a method that can > remove a *given* node (vertex) from the graph with the condition that the > graph remains fully connected. In order to do this, the method may create > new edge(s) as necessary for the fully connected property to hold true. > Does the JGraphT library provide such a method? > > S. > _______________________________________________ > jgrapht-users mailing list > jgr...@li... > https://lists.sourceforge.net/lists/listinfo/jgrapht-users > |
