Tulip 5.7.1
Large graphs analysis and drawing
Loading...
Searching...
No Matches
tlp::SelfLoops Struct Reference

#include <AcyclicTest.h>

+ Collaboration diagram for tlp::SelfLoops:

Public Member Functions

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

Public Attributes

edge e1
 
edge e2
 
edge e3
 
node n1
 
node n2
 
edge old
 

Detailed Description

Stores all the added information 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 43 of file AcyclicTest.h.

Constructor & Destructor Documentation

◆ SelfLoops()

tlp::SelfLoops::SelfLoops ( node  n1,
node  n2,
edge  e1,
edge  e2,
edge  e3,
edge  old 
)
inline

Definition at line 45 of file AcyclicTest.h.

Member Data Documentation

◆ e1

edge tlp::SelfLoops::e1

Definition at line 48 of file AcyclicTest.h.

◆ e2

edge tlp::SelfLoops::e2

Definition at line 48 of file AcyclicTest.h.

◆ e3

edge tlp::SelfLoops::e3

Definition at line 48 of file AcyclicTest.h.

◆ n1

node tlp::SelfLoops::n1

Definition at line 47 of file AcyclicTest.h.

◆ n2

node tlp::SelfLoops::n2

Definition at line 47 of file AcyclicTest.h.

◆ old

edge tlp::SelfLoops::old

Definition at line 48 of file AcyclicTest.h.