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;

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

67 Topology(uint32_t num_routers, const std::vector<BasicExtLink *> &ext_links,
68 const std::vector<BasicIntLink *> &int_links);
69
70 uint32_t numSwitches() const { return m_number_of_switches; }
71 void createLinks(Network *net);
72 void print(std::ostream& out) const { out << "[Topology]"; }
73
74 private:
75 void addLink(SwitchID src, SwitchID dest, BasicLink* link,
76 LinkDirection dir);
77 void makeLink(Network *net, SwitchID src, SwitchID dest,
78 const NetDest& routing_table_entry);
79
80 // Helper functions based on chapter 29 of Cormen et al.
81 void extend_shortest_path(Matrix &current_dist, Matrix &latencies,
82 Matrix &inter_switches);
83
84 std::vector<std::vector<int>> shortest_path(const Matrix &weights,

--- 26 unchanged lines hidden ---