54 NGNode(
const std::string&
id);
63 NGNode(
const std::string&
id,
int xPos,
int yPos);
73 NGNode(
const std::string&
id,
int xID,
int yID,
bool amCenter);
178 return xID == xPos &&
yID == yPos;
std::list< NGEdge * > NGEdgeList
A list of edges (edge pointers)
std::list< NGNode * > NGNodeList
A list of nodes (node pointers)
The representation of a single edge during network building.
Instance responsible for building networks.
Represents a single node (junction) during network building.
A netgen-representation of an edge.
A netgen-representation of a node.
const Position & getPosition() const
Returns this node's position.
int xID
Integer x-position (x-id)
bool connected(NGNode *node) const
Returns whether the other node is connected.
void setFringe()
mark node as fringe
void setY(double y)
Sets a new value for y-position.
void setX(double x)
Sets a new value for x-position.
int yID
Integer y-position (y-id)
NGNode(const std::string &id)
Constructor.
NBNode * buildNBNode(NBNetBuilder &nb, const Position &perturb) const
Builds and returns this node's netbuild-representation.
bool samePos(int xPos, int yPos) const
Returns whether the node has the given position.
bool myAmCenter
Information whether this is the center of a cpider-net.
void setMaxNeighbours(int value)
Sets this node's maximum neighbour number.
Position myPosition
The position of the node.
bool myAmFringe
Information whether this is the center of a cpider-net.
int myMaxNeighbours
The maximum number of neighbours.
void addLink(NGEdge *link)
Adds the given link to the internal list.
void removeLink(NGEdge *link)
Removes the given link.
int getMaxNeighbours()
Returns this node's maximum neighbour number.
NGEdgeList LinkList
List of connected links.
A class that builds random network using an algorithm by Markus Hartinger.
Base class for objects which have an id.
A point in 2D or 3D with translation and scaling methods.
void set(double x, double y)
set positions x and y
double x() const
Returns the x-position.
double y() const
Returns the y-position.