ogdf::topology_module::EdgeLeg Class Reference

Helper class for the computation of crossings. More...

#include <ogdf/planarity/TopologyModule.h>

Public Member Functions
	EdgeLeg ()
	EdgeLeg (edge e, int number, DPoint p1, DPoint p2)
edge &	copyEdge ()
DPoint &	end ()
int &	number ()
DPoint &	start ()

Public Attributes
ListIterator< EdgeLeg * >	m_eIterator
	each edgeLeg holds an entry with a ListIterator pointing to its entry in a <edgeLeg*> List for an original edge More...
bool	m_topDown
	we store the direction of the crossed EdgeLeg, too if crossingEdgeLeg is horizontally left to right More...
DPoint	m_xp
	to avoid sorting both edgelegs and crossing points, do not store a pair of them, but allow the xp to be stored in the edgeleg More...

Private Attributes
edge	m_copyEdge
	the edge in the PlanRep copy corresponding to the EdgeLeg More...
int	m_number
	the order nuumber on the edge, starting at 0 More...
DPoint	m_p1
DPoint	m_p2
	"Starting" and "End" point of the EdgeLeg More...

Detailed Description

Helper class for the computation of crossings.

Represents a part of the edge between two consecutive bends (in the layout, there are no bends allowed in the representation) or crossings. There can be multiple EdgeLegs associated to one copy edge in the PlanRep because of bends.

Definition at line 56 of file TopologyModule.h.

Constructor & Destructor Documentation

EdgeLeg() [1/2]

ogdf::topology_module::EdgeLeg::EdgeLeg ( )

inline

Definition at line 58 of file TopologyModule.h.

EdgeLeg() [2/2]

ogdf::topology_module::EdgeLeg::EdgeLeg ( edge  e, int  number, DPoint  p1, DPoint  p2  )

inline

Definition at line 60 of file TopologyModule.h.

Member Function Documentation

copyEdge()

edge& ogdf::topology_module::EdgeLeg::copyEdge ( )

inline

Definition at line 74 of file TopologyModule.h.

end()

DPoint& ogdf::topology_module::EdgeLeg::end ( )

inline

Definition at line 70 of file TopologyModule.h.

number()

int& ogdf::topology_module::EdgeLeg::number ( )

inline

Definition at line 72 of file TopologyModule.h.

start()

DPoint& ogdf::topology_module::EdgeLeg::start ( )

inline

Definition at line 68 of file TopologyModule.h.

Member Data Documentation

m_copyEdge

edge ogdf::topology_module::EdgeLeg::m_copyEdge

private

the edge in the PlanRep copy corresponding to the EdgeLeg

Definition at line 89 of file TopologyModule.h.

m_eIterator

ListIterator<EdgeLeg*> ogdf::topology_module::EdgeLeg::m_eIterator

each edgeLeg holds an entry with a ListIterator pointing to its entry in a <edgeLeg*> List for an original edge

Definition at line 86 of file TopologyModule.h.

m_number

int ogdf::topology_module::EdgeLeg::m_number

private

the order nuumber on the edge, starting at 0

Definition at line 91 of file TopologyModule.h.

m_p1

DPoint ogdf::topology_module::EdgeLeg::m_p1

private

Definition at line 90 of file TopologyModule.h.

m_p2

DPoint ogdf::topology_module::EdgeLeg::m_p2

private

"Starting" and "End" point of the EdgeLeg

Definition at line 90 of file TopologyModule.h.

m_topDown

bool ogdf::topology_module::EdgeLeg::m_topDown

we store the direction of the crossed EdgeLeg, too if crossingEdgeLeg is horizontally left to right

Definition at line 82 of file TopologyModule.h.

m_xp

DPoint ogdf::topology_module::EdgeLeg::m_xp

to avoid sorting both edgelegs and crossing points, do not store a pair of them, but allow the xp to be stored in the edgeleg

Definition at line 79 of file TopologyModule.h.

---

The documentation for this class was generated from the following file:

• include/ogdf/planarity/TopologyModule.h