40namespace energybased {
48 output <<
"edge_index " << E.
e->
index() <<
" Graph_ptr " << E.
Graph_ptr <<
" angle"
109 if (source_index < target_index) {
129 if (source_index < target_index) {
Includes declaration of graph class.
Basic declarations, included by all source files.
Abstract base class for bucket functions.
Class for the representation of edges.
int index() const
Returns the index of the edge.
node target() const
Returns the target node of the edge.
node source() const
Returns the source node of the edge.
Data type for general directed graphs (adjacency list representation).
Class for the representation of nodes.
int index() const
Returns the (unique) node index.
helping data structure for deleting parallel edges in class FMMMLayout and Multilevel (needed for the...
void set_Edge(edge f, Graph *g_ptr)
friend std::ostream & operator<<(std::ostream &output, const Edge &E)
outputstream for Edge
node get_cut_vertex() const
void set_Edge(edge f, double i, node c)
Graph * get_Graph_ptr() const
int getBucket(const Edge &E) override
int get_max_index(const Edge &E)
returns the maximum index of e
int get_min_index(const Edge &E)
returns the minimum index of e
int getBucket(const Edge &E) override
#define OGDF_ASSERT(expr)
Assert condition expr. See doc/build.md for more information.
The namespace for all OGDF objects.
std::istream & operator>>(std::istream &is, TokenIgnorer token)