67,68c67,68
< Topology(uint32_t num_routers, std::vector<BasicExtLink *> ext_links,
< std::vector<BasicIntLink *> int_links);
---
> Topology(uint32_t num_routers, const std::vector<BasicExtLink *> &ext_links,
> const std::vector<BasicIntLink *> &int_links);
74c74
< protected:
---
> private:
80,81c80,82
< NodeID m_nodes;
< uint32_t m_number_of_switches;
---
> // Helper functions based on chapter 29 of Cormen et al.
> void extend_shortest_path(Matrix &current_dist, Matrix &latencies,
> Matrix &inter_switches);
82a84,95
> std::vector<std::vector<int>> shortest_path(const Matrix &weights,
> Matrix &latencies, Matrix &inter_switches);
>
> bool link_is_shortest_path_to_node(SwitchID src, SwitchID next,
> SwitchID final, const Matrix &weights, const Matrix &dist);
>
> NetDest shortest_path_to_node(SwitchID src, SwitchID next,
> const Matrix &weights, const Matrix &dist);
>
> const uint32_t m_nodes;
> const uint32_t m_number_of_switches;
>
86,88d98
< Matrix m_component_latencies;
< Matrix m_component_inter_switches;
<