Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
common.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Array.h>
35#include <ogdf/basic/Graph.h>
36#include <ogdf/basic/List.h>
37#include <ogdf/basic/geometry.h>
40
41namespace ogdf {
42namespace energybased {
43namespace fmmm {
44
46 const NodeArray<NodeAttributes>& A, const List<node>& contained_nodes) {
47 int length = contained_nodes.size();
48 Array<node> numbered_nodes(length + 1);
49 int i = 1;
50 for (node v : contained_nodes) {
51 numbered_nodes[i] = v;
52 ++i;
53 }
54
55 for (i = 1; i < length; i++) {
56 for (int j = i + 1; j <= length; j++) {
57 node u = numbered_nodes[i];
58 node v = numbered_nodes[j];
59 DPoint f_rep_u_on_v = numexcept::f_rep_u_on_v(A[u].get_position(), A[v].get_position());
60 F_rep[v] += f_rep_u_on_v;
61 F_rep[u] -= f_rep_u_on_v;
62 }
63 }
64}
65
66}
67}
68}
Declaration and implementation of Array class and Array algorithms.
Includes declaration of graph class.
Declaration of doubly linked lists and iterators.
Declaration of class NodeAttributes.
Declaration of classes GenericPoint, GenericPolyline, GenericLine, GenericSegment,...
The parameterized class Array implements dynamic arrays of type E.
Definition Array.h:219
Doubly linked lists (maintaining the length of the list).
Definition List.h:1451
int size() const
Returns the number of elements in the list.
Definition List.h:1488
Class for the representation of nodes.
Definition Graph_d.h:241
static DPoint f_rep_u_on_v(DPoint pos_u, DPoint pos_v)
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition Graph_d.h:659
void calculate_forces_inside_contained_nodes(NodeArray< DPoint > &F_rep, const NodeArray< NodeAttributes > &A, const List< node > &contained_nodes)
Definition common.h:45
The namespace for all OGDF objects.
Declaration of class numexcept (handling of numeric problems).