ant.msg

In this implementation of AntNet-3.0 one could get the behavior of both algorithms through a simple

// -*- C++ -*-
// Copyright (C) 2003 Leherstuh f黵 Betrieb System/ Verteilte System, 
// Universitaet Dortmund 
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.

// Author: Muddassar Farooq
// Informatik III, Universitaet Dortmund
// Germany


//-------------------------------
// File: ant.msg
// This file describes the ant message that represent
// agents that will explore the network
//  (part of AntNet Routing Simulation)
//-------------------------------

// an entry that will be pushed on to the stack

struct antStackEntry
{
	fields:

		int nodeAddress;
		double nodeEntranceTime;
		
};


message Ant
{
	properties:
		customize = true;

	fields:
		int sourceNode;
		int destNode;
		int hops;
		abstract int visitedNodes[]; // will use vector<int>
		abstract antStackEntry cycleNodes[]; // will use to track cycle algorithm
};