Contents

• Contents
• List of Figures
• Introduction:
  • Why Should We Care?
  • Background Reading and Study:
• The Void List Type:
  • A Specific List Class: Double Lists:
  • The Void Access Class:
    • The Void Access Definitions:
    • The Void Access Implementation:
  • The Void List Class:
    • The Void List Definitions:
    • The Void List Implementation:
• The General Graph Class:
  • The Graph Class:
    • The Class Description: Header: graph.h
    • The Constructor and Destructor
    • Iterators
    • Overloaded I/O and Grab and Print:
    • Add a Node:
    • Add an Edge:
    • Find a Node:
    • Remove a Node:
    • Find an Edge:
    • Remove an Edge:
    • The Public Interface: nodes() and edges()
  • Complete Listing of the Graph-Related Source Code
    • The Edge Class:
    • The Node Class:
    • The Bag Classes:
    • The Graph Class:
  • Run Time Results:
• Adding Visualization to the Graph Class:
  • The Visual Graph Class:
    • xgraph.h
    • xgraph.c
• The Graphical Interface to the Graph Class:
  • run.c
  • Run Time Results: Manual Graph Creation
  • Specifying a Graph Via a File:
    • The Specifications of the Input File:
    • The Graph::ReadInputFile Method:
    • The New Run Method:
    • RunTime Results: File Construction of the Graph Object:
  • Generating Random Graphs:
• Arbitrary Graph Objects Via Void * Data:
  • Altering the Graph Class for Void * Data:
  • A First Run-Time Example:
  • A Second Run-Time Example:
  • Implementing the Access Methods as a Class:
  • A Run-time Example Using the ACCESS Class:
• Graphs of Graphs:
  • The New ACCESS_GRAPH Class:
  • The New Run Time Code:
    • Construct Graph G1:
    • Construct Graph G2:
    • Construct the Complex Graph:
• References: