/* $Header: /home/cs/guest/javagrp/netdesign/network/RCS/AdjacentList.java,v 1.1 1996/05/21 21:15:30 hma Exp $ */
/* $Log: AdjacentList.java,v $
# Revision 1.1  1996/05/21  21:15:30  hma
# Initial revision
# */
package network;

import util.* ;

//******************************************************************
// adjacent list
// for a given network, every switch has a list of adjacent switches
// this is used to construct shortest pathes in Dijkstra's algorithm
public class AdjacentList {
  public Object origin;
  public Vector adjacent;
  public AdjacentList(Object o, Vector adj) {
    origin = o;
    adjacent = (Vector)adj.clone();
  }
  public AdjacentList(Object o) {
    origin = o;
    adjacent = new Vector();
  }
}
