Public Member Functions
	SelfLoops (node n1, node n2, edge e1, edge e2, edge e3, edge old)

Detailed Description

Stores all the added informations on self loops.

Self loops are removed by adding two nodes and three edges.

These are stores here, along with the old self looping edge.

From Wikipedia: "A directed acyclic graph (DAG), is a directed graph with no directed cycles."

Definition at line 41 of file AcyclicTest.h.

Public Member Functions