Implementation details: ----------------------- Each node has a pointer to its father, its right brother, and its first son. Each node also has a pointer to its list of properties, as well as an extra bit used to efficiently find the shortest path between two nodes. This data structure assumes that time and not space is the major performance bottleneck.
Definition in file SgNode.cpp.
#include "SgSystem.h"
#include "SgNode.h"
#include <sstream>
#include "SgPointSet.h"
#include "SgProp.h"
#include "SgVector.h"
Go to the source code of this file.