Overview     Modules     Class Hierarchy     Classes     Members  
tlp::SimpleTest Class Reference

#include <SimpleTest.h>

Inheritance diagram for tlp::SimpleTest:
Collaboration diagram for tlp::SimpleTest:

List of all members.

Static Public Member Functions

static bool isSimple (Graph *graph)
static void makeSimple (Graph *graph, std::vector< edge > &removed)
static bool simpleTest (Graph *graph, std::vector< edge > *multipleEdges=0, std::vector< edge > *loops=0)

Additional Inherited Members

- Public Member Functions inherited from tlp::GraphObserver
 GraphObserver ()
virtual ~GraphObserver ()
 GraphObserver (const GraphObserver &)
GraphObserveroperator= (const GraphObserver &)
virtual void addNode (Graph *, const node)
virtual void beforeSetEnds (Graph *, const edge)
virtual void afterSetEnds (Graph *, const edge)
virtual void delNode (Graph *, const node)
virtual void reverseEdge (Graph *, const edge)
virtual void addSubGraph (Graph *, Graph *)
virtual void delSubGraph (Graph *, Graph *)
virtual void addLocalProperty (Graph *, const std::string &)
virtual void beforeDelLocalProperty (Graph *g, const std::string &pName)
virtual void afterDelLocalProperty (Graph *, const std::string &)
virtual void delLocalProperty (Graph *, const std::string &)
virtual void addInheritedProperty (Graph *, const std::string &)
virtual void beforeDelInheritedProperty (Graph *, const std::string &)
virtual void afterDelInheritedProperty (Graph *, const std::string &)
virtual void beforeSetAttribute (Graph *, const std::string &)
virtual void afterSetAttribute (Graph *, const std::string &)
virtual void removeAttribute (Graph *, const std::string &)

Detailed Description

class for testing if the graph is simple (ie no self loops and no multiple or parallel edges)


Member Function Documentation

static bool tlp::SimpleTest::isSimple ( Graph graph)
static

Returns true if the graph is simple (i.e. it contains no self loops or parallel edges), false otherwise.

static void tlp::SimpleTest::makeSimple ( Graph graph,
std::vector< edge > &  removed 
)
static

Makes the graph simple by removing self loops and parallel edges if any. The removed edges are stored in the removed vector.

static bool tlp::SimpleTest::simpleTest ( Graph graph,
std::vector< edge > *  multipleEdges = 0,
std::vector< edge > *  loops = 0 
)
static

Performs simple test and stores found parallel edges in the multipleEdges vector and found self loops in the loops vector. Returns true if the graph is simple, false otherwise.



Tulip Software by LaBRI Visualization Team    2001 - 2012