X-Git-Url: http://bilbo.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/bd7d5780ee8b73efd58c83f5d6f864d0a941b3ed..95a02a8febe84fd1c2ed98c78c594a5e8a0116f7:/src/kernel/routing/RoutedZone.hpp diff --git a/src/kernel/routing/RoutedZone.hpp b/src/kernel/routing/RoutedZone.hpp deleted file mode 100644 index 1a874b060b..0000000000 --- a/src/kernel/routing/RoutedZone.hpp +++ /dev/null @@ -1,78 +0,0 @@ -/* Copyright (c) 2013-2017. The SimGrid Team. All rights reserved. */ - -/* This program is free software; you can redistribute it and/or modify it - * under the terms of the license (GNU LGPL) which comes with this package. */ - -#ifndef SIMGRID_ROUTING_GENERIC_HPP_ -#define SIMGRID_ROUTING_GENERIC_HPP_ - -#include "src/kernel/routing/NetZoneImpl.hpp" - -namespace simgrid { -namespace kernel { -namespace routing { - -/** @ingroup ROUTING_API - * @brief NetZone with an explicit routing (abstract class) - * - * This abstract class factorizes code between its subclasses: Full, Dijkstra and Floyd. - * - *
DijkstraZone | FloydZone | FullZone | |
Platform-file content | - *Only 1-hop routes (rather small) | - *Only 1-hop routes (rather small) | - *Every path, explicitly (very large) | - *
Initialization time | - *Almost nothing | - *Floyd-Warshall algorithm: O(n^3) | - *Almost nothing | - *
Memory usage | - *1-hop routes (+ cache of routes) | - *O(n^2) data (intermediate) | - *O(n^2) + sum of path lengths (very large) | - *
Lookup time | - *Dijkstra Algo: O(n^3) | - *not much (reconstruction phase) | - *Almost nothing | - *
Expressiveness | - *Only shortest path | - *Only shortest path | - *Everything | - *