#include <graph.h>
The class GEdge
defines a undirected edge between two nodes. An edge is characterized by a weight and the index of the connected node.
Public Member Functions | |
GEdge (Long n, GEdge *adj, Double w=1) | |
GEdge (Long n, GEdge *adj, Long i, Double w=1) | |
~GEdge () | |
Long | Node () const |
GEdge * | Next () const |
GEdge * | Next (GEdge *n) |
Long | Item () const |
Long | Item (Long i) |
Public Attributes | |
Double | weight |
|
Creates a new edge to the specified node, with the specified weight and the specified next edge.
|
|
Creates a new edge to the specified node, with the specified weight and the specified next edge.
|
|
Deletes the node. |
|
Sets the new index of the referenced object.
|
|
Returns the index of the referenced object.
|
|
Sets a new neighbourhood node.
|
|
Returns the next neighbourhood node.
|
|
Returns the number of the adjacent node.
|
|
The valuation of the edge. |