X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;f=src%2Fsalomeloader%2Fgraph.py;h=9586575c8d6eafebf90a26c41b3f6c3082236ea8;hb=9c6af7fa973eb5d2ed36eb3d64390940d13fbd08;hp=9bdd99b2b8754c3eeb1910ead80a948661c31492;hpb=313a04631c63078d01c2f643a53500ec549d034e;p=modules%2Fyacs.git diff --git a/src/salomeloader/graph.py b/src/salomeloader/graph.py index 9bdd99b2b..9586575c8 100644 --- a/src/salomeloader/graph.py +++ b/src/salomeloader/graph.py @@ -1,4 +1,23 @@ # -*- coding: iso-8859-1 -*- +# Copyright (C) 2006-2016 CEA/DEN, EDF R&D +# +# This library is free software; you can redistribute it and/or +# modify it under the terms of the GNU Lesser General Public +# License as published by the Free Software Foundation; either +# version 2.1 of the License, or (at your option) any later version. +# +# This library is distributed in the hope that it will be useful, +# but WITHOUT ANY WARRANTY; without even the implied warranty of +# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +# Lesser General Public License for more details. +# +# You should have received a copy of the GNU Lesser General Public +# License along with this library; if not, write to the Free Software +# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA +# +# See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com +# + """ This module contains graph utilities @@ -9,7 +28,8 @@ """ import os -from sets import Set +#from sets import Set +Set=set def invert(G): """Construit le graphe inverse de G en inversant les liens de voisinage""" @@ -23,8 +43,8 @@ def invert(G): def reachable(G,n): """Construit le set de noeuds atteignables depuis le noeud n - Le noeud n n'est pas dans le set retourné sauf en cas de boucles - Ce cas n'est pas traité ici (limitation) + Le noeud n n'est pas dans le set retourne sauf en cas de boucles + Ce cas n'est pas traite ici (limitation) """ s=G[n] for v in G[n]: @@ -75,9 +95,9 @@ def test(): } display(G) I=invert(G) - print reachable(G,2) - print reachable(I,6) - print reachable(G,2) & reachable(I,6) + print(reachable(G,2)) + print(reachable(I,6)) + print(reachable(G,2) & reachable(I,6)) if __name__ == "__main__": test()