//****************************************************************************
//
// Cs361      : Fall 2003 Ohio University Travis Dillon
// Homework 5 : Breadth first spanning trees
// file       : node.h
// started    : 10-14-03
// summary    : This is the header for the Node class.
//
//****************************************************************************


#ifndef NODE_H
#define NODE_H

#include "prog3.h"

class Graph;

class Node
{
   friend class Graph;
 public:
   Node(size_t in_id, float in_weight);
   size_t get_id();
 private:
   float weight;  //the value of the edge between two verticies
   size_t id;  //this is where the edge leads to
};

#endif  //NODE_H