-
Notifications
You must be signed in to change notification settings - Fork 0
graph end_node
Ned Bingham edited this page Apr 2, 2017
·
2 revisions
struct end_node
A placeholder node to represent the boundaries of a linked list of graph nodes.
-
end_node *left, *right
are pointers to the contents of the list. -
int index
is the index of this node.
end_node()
The default constructor. left
and right
are both set to this
to create a cycle and index
is set to -1
. This way if someone tries to iterate beyond the boundaries of the list, they repeatedly just end up at the boundary.