|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
40 namespace 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) {
The namespace for all OGDF objects.
Graph * get_Graph_ptr() const
Includes declaration of graph class.
#define OGDF_ASSERT(expr)
Assert condition expr. See doc/build.md for more information.
int index() const
Returns the (unique) node index.
int index() const
Returns the index of the edge.
helping data structure for deleting parallel edges in class FMMMLayout and Multilevel (needed for the...
Abstract base class for bucket functions.
int getBucket(const Edge &E) override
int get_max_index(const Edge &E)
returns the maximum index of e
friend std::ostream & operator<<(std::ostream &output, const Edge &E)
outputstream for Edge
void set_Edge(edge f, Graph *g_ptr)
int getBucket(const Edge &E) override
node source() const
Returns the source node of the edge.
int get_min_index(const Edge &E)
returns the minimum index of e
Data type for general directed graphs (adjacency list representation).
void set_Edge(edge f, double i, node c)
Basic declarations, included by all source files.
Class for the representation of edges.
std::istream & operator>>(std::istream &is, TokenIgnorer token)
node target() const
Returns the target node of the edge.
Class for the representation of nodes.
node get_cut_vertex() const