helping data structure for deleting parallel edges in class FMMMLayout and Multilevel (needed for the bucket sort algorithm)
More...
#include <ogdf/energybased/fmmm/multilevel/Edge.h>
helping data structure for deleting parallel edges in class FMMMLayout and Multilevel (needed for the bucket sort algorithm)
Definition at line 45 of file Edge.h.
◆ Edge()
| ogdf::energybased::fmmm::Edge::Edge |
( |
| ) |
|
|
inline |
constructor
Definition at line 64 of file Edge.h.
◆ get_angle()
| double ogdf::energybased::fmmm::Edge::get_angle |
( |
| ) |
const |
|
inline |
◆ get_cut_vertex()
| node ogdf::energybased::fmmm::Edge::get_cut_vertex |
( |
| ) |
const |
|
inline |
◆ get_edge()
| edge ogdf::energybased::fmmm::Edge::get_edge |
( |
| ) |
const |
|
inline |
◆ get_Graph_ptr()
| Graph * ogdf::energybased::fmmm::Edge::get_Graph_ptr |
( |
| ) |
const |
|
inline |
◆ set_Edge() [1/2]
| void ogdf::energybased::fmmm::Edge::set_Edge |
( |
edge |
f, |
|
|
double |
i, |
|
|
node |
c |
|
) |
| |
|
inline |
◆ set_Edge() [2/2]
| void ogdf::energybased::fmmm::Edge::set_Edge |
( |
edge |
f, |
|
|
Graph * |
g_ptr |
|
) |
| |
|
inline |
◆ operator<<
| std::ostream & operator<< |
( |
std::ostream & |
output, |
|
|
const Edge & |
E |
|
) |
| |
|
friend |
◆ angle
| double ogdf::energybased::fmmm::Edge::angle |
|
private |
◆ cut_vertex
| node ogdf::energybased::fmmm::Edge::cut_vertex |
|
private |
| edge ogdf::energybased::fmmm::Edge::e |
|
private |
◆ Graph_ptr
| Graph* ogdf::energybased::fmmm::Edge::Graph_ptr |
|
private |
The documentation for this class was generated from the following file:
- include/ogdf/energybased/fmmm/multilevel/Edge.h