1/*
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;

--- 269 unchanged lines hidden (view full) ---

278void
279Topology::clearStats()
280{
281 for (int cntrl = 0; cntrl < m_controller_vector.size(); cntrl++) {
282 m_controller_vector[cntrl]->clearStats();
283 }
284}
285
286// The following all-pairs shortest path algorithm is based on the
287// discussion from Cormen et al., Chapter 26.1.
288void
289extend_shortest_path(Matrix& current_dist, Matrix& latencies,
290 Matrix& inter_switches)
291{
292 bool change = true;
293 int nodes = current_dist.size();

--- 90 unchanged lines hidden ---