routingtable.h

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: routingTable.h
//        (part of AntNet Routing Simulation)
//-------------------------------------------------------------

#ifndef __ROUTING_TABLE_H
#define __ROUTING_TABLE_H

#include <iostream>
#include <omnetpp.h>
using namespace std;


struct routingTableEntry
{
	double neighborGoodnessToDestination;
	double backUp;
	
};

typedef struct routingTableEntry rEntry;


class routingTable: public cObject
{
	friend ostream& operator<<(ostream& os, routingTable& table);

	private:
		rEntry *rTable;
		int *map;
		int nodes;
		int neighbors;

	public:
		routingTable(const char* name = NULL);
		routingTable(int nodes, int neighbors, const char* name = NULL);
		routingTable(const routingTable& rhs);
		routingTable& operator=(const routingTable& rhs);
		virtual ~routingTable();

		virtual cObject* dup() const;
		virtual void info(char *buf);
		virtual void writeContents(ostream& os);


		void mapNeighborsToArrayIndex(int *neighbor);
		int findNeighborIndex(int neighbor);

		double getDestViaThisNeighborProb(int dest, int neighbor);
		void setDestViaThisNeighborProb(int dest, int neighbor, double prob);

};

#endif