2 # NEPI, a framework to manage network experiments
3 # Copyright (C) 2013 INRIA
5 # This program is free software: you can redistribute it and/or modify
6 # it under the terms of the GNU General Public License as published by
7 # the Free Software Foundation, either version 3 of the License, or
8 # (at your option) any later version.
10 # This program is distributed in the hope that it will be useful,
11 # but WITHOUT ANY WARRANTY; without even the implied warranty of
12 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 # GNU General Public License for more details.
15 # You should have received a copy of the GNU General Public License
16 # along with this program. If not, see <http://www.gnu.org/licenses/>.
18 # Author: Alina Quereilhac <alina.quereilhac@inria.fr>
20 def match_tags(box, all_tags, exact_tags):
21 """ returns True if box has required tags """
23 texact = set(exact_tags)
25 if texact and box.connections == texact:
28 if tall and tall.issubset(box.connections):
33 def find_boxes(box, all_tags = None, exact_tags = None, max_depth = 1):
34 """ Look for the connected boxes with the required tags, doing breath-first
35 search, until max_depth ( max_depth = None will traverse the entire graph ).
37 if not all_tags and not exact_tags:
38 msg = "No matching criteria for resources."
39 raise RuntimeError(msg)
42 # enqueue (depth, box)
53 (depth, a) = queue.pop()
54 if match_tags(a, all_tags, exact_tags):
57 if not max_depth or depth <= max_depth:
59 for b in sorted(a.connections):
60 if b not in traversed: