Skip to content
Ned Bingham edited this page Apr 2, 2017 · 2 revisions

std/graph.h


graph

  • struct end_node

A placeholder node to represent the boundaries of a linked list of graph nodes.

Member Variables

  • end_node *left, *right are pointers to the contents of the list.
  • int index is the index of this node.

Member Functions

Constructor

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.

Simple Containers

Standard Containers

Interface Containers

Specialized Containers

Input/Output

Algorithm

Clone this wiki locally