Structure of neighboring nodes: two neighboring nodes from standpoint of a given cell with an ordering "first" and "second" that corresponds with the node traversal order in that cell. More...

#include <NeighborNodes.h>

Collaboration diagram for SimPT_Sim::NeighborNodes:

Public Member Functions
	NeighborNodes (Cell c=nullptr, Node n1=nullptr, Node *n2=nullptr)
	Plain constructor.

Cell *	GetCell () const
	Return the cell of this Neighbor pair.

Node *	GetNb1 () const
	Return first node of this Neighbor pair.

Node *	GetNb2 () const
	Return second node of this Neighbor pair.

bool	operator!= (const NeighborNodes &nn) const
	Inequality test.

bool	operator== (const NeighborNodes &nn) const
	Equality test.

Detailed Description

Structure of neighboring nodes: two neighboring nodes from standpoint of a given cell with an ordering "first" and "second" that corresponds with the node traversal order in that cell.

Definition at line 34 of file NeighborNodes.h.

The documentation for this class was generated from the following files:

Public Member Functions

Detailed Description