00001 00002 /* 00003 * tnode.cc 00004 * Copyright (C) 2000 by the University of Southern California 00005 * $Id: tnode.cc,v 1.5 2005/08/25 18:58:11 johnh Exp $ 00006 * 00007 * This program is free software; you can redistribute it and/or 00008 * modify it under the terms of the GNU General Public License, 00009 * version 2, as published by the Free Software Foundation. 00010 * 00011 * This program is distributed in the hope that it will be useful, 00012 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00013 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00014 * GNU General Public License for more details. 00015 * 00016 * You should have received a copy of the GNU General Public License along 00017 * with this program; if not, write to the Free Software Foundation, Inc., 00018 * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA. 00019 * 00020 * 00021 * The copyright of this module includes the following 00022 * linking-with-specific-other-licenses addition: 00023 * 00024 * In addition, as a special exception, the copyright holders of 00025 * this module give you permission to combine (via static or 00026 * dynamic linking) this module with free software programs or 00027 * libraries that are released under the GNU LGPL and with code 00028 * included in the standard release of ns-2 under the Apache 2.0 00029 * license or under otherwise-compatible licenses with advertising 00030 * requirements (or modified versions of such code, with unchanged 00031 * license). You may copy and distribute such a system following the 00032 * terms of the GNU GPL for this module and the licenses of the 00033 * other code concerned, provided that you include the source code of 00034 * that other code when and as the GNU GPL requires distribution of 00035 * source code. 00036 * 00037 * Note that people who make modified versions of this module 00038 * are not obligated to grant this special exception for their 00039 * modified versions; it is their choice whether to do so. The GNU 00040 * General Public License gives permission to release a modified 00041 * version without this exception; this exception also makes it 00042 * possible to release a modified version which carries forward this 00043 * exception. 00044 * 00045 */ 00046 00047 /* 00048 * Test nodes for testing routing algorithms 00049 * contributed to ns 00050 * George Riley, Georgia Tech, Winter 2000 00051 */ 00052 00053 #include "config.h" 00054 #ifdef HAVE_STL 00055 00056 #include <stdio.h> 00057 00058 #include "routealgo/tnode.h" 00059 00060 void Node::AddAdj( nodeid_t a, int w) 00061 { 00062 Edge* pE; 00063 00064 pE= new Edge(a, w); 00065 m_Adj.push_back(pE); 00066 } 00067 00068 const NodeWeight_t Node::NextAdj( const NodeWeight_t& last) 00069 { 00070 Edge* pE; 00071 00072 static EdgeVec_it prev; 00073 if (last.first == NODE_NONE) 00074 { 00075 prev = m_Adj.begin(); 00076 pE = *prev; 00077 if(0)printf("NextAdj returning first edge %ld w %d\n", 00078 pE->m_n, pE->m_w); 00079 return(NodeWeight_t(pE->m_n, pE->m_w)); 00080 } 00081 else 00082 { // See if last is prev 00083 if (last.first == (*prev)->m_n) 00084 { //Yep, just advance iterator 00085 prev++; 00086 if (prev == m_Adj.end()) 00087 { // No more 00088 return(NodeWeight_t(NODE_NONE, 0)); 00089 } 00090 else 00091 { 00092 pE = *prev; 00093 if(0)printf("NextAdj returning next edge %ld w %d\n", 00094 pE->m_n, pE->m_w); 00095 return(NodeWeight_t(pE->m_n, pE->m_w)); 00096 } 00097 } 00098 else 00099 { // Need to code this 00100 printf("Non-linear advance of NextAdj\n"); 00101 exit(1); 00102 } 00103 } 00104 } 00105 00106 #endif //HAVE_STL
1.4.6