Overview
Modules
Class Hierarchy
Classes
Members
Selection
Classes
class
InducedSubGraphSelection
This selection plugins enables to find a subgraph induced by a set of nodes.
More...
class
Kruskal
This selection plugins implements the so called
Kruskal
algorithm. This algorithm enables to find a minimum spanning tree in a connected graph.
More...
class
LoopSelection
This selection plugins enables to find loops in a graph.
More...
class
MultipleEdgeSelection
This selection plugins enables to find the multiple-edges and parallel-edges in a graph.
More...
class
ReachableSubGraphSelection
class
SpanningDagSelection
This selection plugins enables to find a subgraph of G that is acyclic.
More...
class
SpanningTreeSelection
This selection plugins enables to find a subgraph of G that is a forest (a set of trees).
More...
Tulip Software by David AUBER 2001 - 2006