dft2hd2reliabilityr 0.2.0__tar.gz

dft2hd2reliabilityr-0.2.0/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2022 ARDIS4SD
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

dft2hd2reliabilityr-0.2.0/PKG-INFO

@@ -0,0 +1,137 @@
+Metadata-Version: 2.4
+Name: dft2hd2reliabilityr
+Version: 0.2.0
+Summary: Dynamic Fault Tree -> Hasse diagram -> Reliability: minimal cut sets, minimal links and system reliability polynomials
+Author-email: "Dr. Fotsa-Mbogne David Jaures" <jauresfotsa@gmail.com>
+Maintainer-email: "Dr. Fotsa-Mbogne David Jaures" <jauresfotsa@gmail.com>
+License: MIT License
+        
+        Copyright (c) 2022 ARDIS4SD
+        
+        Permission is hereby granted, free of charge, to any person obtaining a copy
+        of this software and associated documentation files (the "Software"), to deal
+        in the Software without restriction, including without limitation the rights
+        to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+        copies of the Software, and to permit persons to whom the Software is
+        furnished to do so, subject to the following conditions:
+        
+        The above copyright notice and this permission notice shall be included in all
+        copies or substantial portions of the Software.
+        
+        THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+        IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+        FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+        AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+        LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+        OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+        SOFTWARE.
+        
+Project-URL: Homepage, https://github.com/ARDIS4SD/DFT2HD2ReliabilityR
+Project-URL: Repository, https://github.com/ARDIS4SD/DFT2HD2ReliabilityR
+Keywords: fault tree,dynamic fault tree,reliability,safety,Hasse diagram,minimal cut sets,minimal links,dependability
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: Intended Audience :: Manufacturing
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering
+Classifier: Topic :: Software Development :: Libraries :: Python Modules
+Requires-Python: >=3.9
+Description-Content-Type: text/x-rst
+License-File: LICENSE
+Requires-Dist: sympy>=1.9
+Provides-Extra: viz
+Requires-Dist: matplotlib>=3.5; extra == "viz"
+Requires-Dist: networkx>=2.6; extra == "viz"
+Provides-Extra: test
+Requires-Dist: pytest>=7.0; extra == "test"
+Dynamic: license-file
+
+.. image:: https://github.com/ARDIS4SD/DFT2HD2ReliabilityR/blob/main/DFT2HD2ReliabilityR.svg
+
+
+A quoi sert ce projet ?
+========================
+Le projet a pour de mettre à disposition des maintenanciers ayant 
+des connaissances de base de programmation python, des fonctions 
+permettant de construire des structures d'évaluation de la fiabilité 
+(arbre de défaillance, diagramme de Hasse). En particulier, il vise à 
+faire le calcul rapide par la méthode de satisfiabilité (coupe, lien, 
+polynôme de fiabilité).
+
+The project aims to provide maintainers with basic knowledge of python 
+programming, functions to build reliability assessment structures (fault 
+tree, Hasse diagram). In particular, it aims to do fast computation by the 
+satisfiability method (cut, link, reliability polynomial).
+
+
+Pourquoi ce projet est-il utile ?
+=================================
+
+L'évaluation de la fiabilité est un enjeux majeur de la maintenance qui elle même
+est indispensable pour la productivité des entreprises. Le fait est que la maintenance 
+moderne est assistée par ordinateur. Malheureusement, les logiciels de gestion de la 
+maintenance sont assez onéreux. Il serait idéal de developper un projet open source 
+permettant de pallier le problème de coût, et de developper un communauté collaborative 
+qui fera rapidement avancer de façon ludique, les outils logiciels de pointe en matière
+de maintenance.
+
+Reliability assessment is a major maintenance issue which itself is essential for business 
+productivity. The fact is that maintenance modern is computer-assisted. Unfortunately, maintenance 
+management sofwares are quite expensive. It would be ideal to develop an open source project to 
+overcome the cost problem, and to develop a collaborative community which will quickly advance in 
+a playful way, the cutting-edge software tools for maintenance.
+
+Comment démarrer ?
+====================
+
+Installation (package publiable `dft2hd2reliabilityr`, dépendance dure : sympy)::
+
+    pip install dft2hd2reliabilityr            # (après publication PyPI)
+    # ou depuis ce dépôt :
+    pip install .                              # dépendance sympy uniquement
+    pip install ".[viz]"                       # + matplotlib/networkx (ViewGraph)
+    pip install -e ".[test]"                   # mode développement + pytest
+
+Utilisation minimale — fiabilité d'un système OR 2 composants::
+
+    from dft2hd2reliabilityr import FaultTree, DownHasseDiagram, One
+    import sympy
+
+    tree = FaultTree(3)
+    tree.NewRelation(3, [1, 1, 0], [0, 0, 1])          # OR(c0, c1)
+    h = DownHasseDiagram(tree, [0, 1], [sympy.Symbol("R1"), sympy.Symbol("R2")],
+                         [[1], [1]], [One, One], [0], 1)
+    print(h.GetPolyFiab())                             # -> poly de fiabilité
+
+Vérification (corrections, cf. CORRECTIONS.md)::
+
+    python -m pytest -q                       # 14 tests unitaires (< 2 s)
+    python -m pytest --doctest-modules src -q # 17 doctests réels (< 1 s)
+
+Documentation de projet::
+
+    ANALYSE.md       analyse technique complète + feuille de route publication PyPI
+                     + plan IA de décision de maintenance (importance -> sampling -> ML)
+    CORRECTIONS.md   journal complet et tracé de TOUTES les modifications de code
+                     (identifiants CORRECTION-01..12 — CORRECTION-09 : coupes
+                     minimales exactes, CORRECTION-10 : sortie unifiée
+                     ReliabilityResult, CORRECTION-11 : packaging src/ + PyPI-ready,
+                     CORRECTION-12 : CI/lint/doctests —, tests associés)
+
+Où puis-je obtenir plus d'aide, si j'en ai besoin?
+====================================================
+
+En cas de besoin d'aide, bien vouloir contacter l'auteur Dr. Fotsa-Mbogne David Jaures à l'une 
+des adresses jauresfotsa@gmail.com, david_jamesf@yahoo.fr et mjd.fotsa@univ-ndere.cm . Dr. Fotsa-Mbogne
+est également disponible sur la page https://sites.google.com/site/mjdavidfotsa/home
+
+If you need help, please contact the author Dr. Fotsa-Mbogne David Jaures at one addresses 
+jauresfotsa@gmail.com, david_jamesf@yahoo.fr and mjd.fotsa@univ-ndere.cm. Dr. Fotsa-Mbogne is also 
+available at https://sites.google.com/site/mjdavidfotsa/home
+

dft2hd2reliabilityr-0.2.0/README.rst

@@ -0,0 +1,83 @@
+.. image:: https://github.com/ARDIS4SD/DFT2HD2ReliabilityR/blob/main/DFT2HD2ReliabilityR.svg
+
+
+A quoi sert ce projet ?
+========================
+Le projet a pour de mettre à disposition des maintenanciers ayant 
+des connaissances de base de programmation python, des fonctions 
+permettant de construire des structures d'évaluation de la fiabilité 
+(arbre de défaillance, diagramme de Hasse). En particulier, il vise à 
+faire le calcul rapide par la méthode de satisfiabilité (coupe, lien, 
+polynôme de fiabilité).
+
+The project aims to provide maintainers with basic knowledge of python 
+programming, functions to build reliability assessment structures (fault 
+tree, Hasse diagram). In particular, it aims to do fast computation by the 
+satisfiability method (cut, link, reliability polynomial).
+
+
+Pourquoi ce projet est-il utile ?
+=================================
+
+L'évaluation de la fiabilité est un enjeux majeur de la maintenance qui elle même
+est indispensable pour la productivité des entreprises. Le fait est que la maintenance 
+moderne est assistée par ordinateur. Malheureusement, les logiciels de gestion de la 
+maintenance sont assez onéreux. Il serait idéal de developper un projet open source 
+permettant de pallier le problème de coût, et de developper un communauté collaborative 
+qui fera rapidement avancer de façon ludique, les outils logiciels de pointe en matière
+de maintenance.
+
+Reliability assessment is a major maintenance issue which itself is essential for business 
+productivity. The fact is that maintenance modern is computer-assisted. Unfortunately, maintenance 
+management sofwares are quite expensive. It would be ideal to develop an open source project to 
+overcome the cost problem, and to develop a collaborative community which will quickly advance in 
+a playful way, the cutting-edge software tools for maintenance.
+
+Comment démarrer ?
+====================
+
+Installation (package publiable `dft2hd2reliabilityr`, dépendance dure : sympy)::
+
+    pip install dft2hd2reliabilityr            # (après publication PyPI)
+    # ou depuis ce dépôt :
+    pip install .                              # dépendance sympy uniquement
+    pip install ".[viz]"                       # + matplotlib/networkx (ViewGraph)
+    pip install -e ".[test]"                   # mode développement + pytest
+
+Utilisation minimale — fiabilité d'un système OR 2 composants::
+
+    from dft2hd2reliabilityr import FaultTree, DownHasseDiagram, One
+    import sympy
+
+    tree = FaultTree(3)
+    tree.NewRelation(3, [1, 1, 0], [0, 0, 1])          # OR(c0, c1)
+    h = DownHasseDiagram(tree, [0, 1], [sympy.Symbol("R1"), sympy.Symbol("R2")],
+                         [[1], [1]], [One, One], [0], 1)
+    print(h.GetPolyFiab())                             # -> poly de fiabilité
+
+Vérification (corrections, cf. CORRECTIONS.md)::
+
+    python -m pytest -q                       # 14 tests unitaires (< 2 s)
+    python -m pytest --doctest-modules src -q # 17 doctests réels (< 1 s)
+
+Documentation de projet::
+
+    ANALYSE.md       analyse technique complète + feuille de route publication PyPI
+                     + plan IA de décision de maintenance (importance -> sampling -> ML)
+    CORRECTIONS.md   journal complet et tracé de TOUTES les modifications de code
+                     (identifiants CORRECTION-01..12 — CORRECTION-09 : coupes
+                     minimales exactes, CORRECTION-10 : sortie unifiée
+                     ReliabilityResult, CORRECTION-11 : packaging src/ + PyPI-ready,
+                     CORRECTION-12 : CI/lint/doctests —, tests associés)
+
+Où puis-je obtenir plus d'aide, si j'en ai besoin?
+====================================================
+
+En cas de besoin d'aide, bien vouloir contacter l'auteur Dr. Fotsa-Mbogne David Jaures à l'une 
+des adresses jauresfotsa@gmail.com, david_jamesf@yahoo.fr et mjd.fotsa@univ-ndere.cm . Dr. Fotsa-Mbogne
+est également disponible sur la page https://sites.google.com/site/mjdavidfotsa/home
+
+If you need help, please contact the author Dr. Fotsa-Mbogne David Jaures at one addresses 
+jauresfotsa@gmail.com, david_jamesf@yahoo.fr and mjd.fotsa@univ-ndere.cm. Dr. Fotsa-Mbogne is also 
+available at https://sites.google.com/site/mjdavidfotsa/home
+

dft2hd2reliabilityr-0.2.0/pyproject.toml

@@ -0,0 +1,90 @@
+# CORRECTION-11 : packaging PEP 621 (cf. CORRECTIONS.md §2, CORRECTION-11).
+# Layout src/ unique : src/dft2hd2reliabilityr (la racine et l'ancien dossier
+# `source/` n'existent plus).
+
+[build-system]
+requires = ["setuptools>=61"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "dft2hd2reliabilityr"
+version = "0.2.0"
+description = "Dynamic Fault Tree -> Hasse diagram -> Reliability: minimal cut sets, minimal links and system reliability polynomials"
+readme = "README.rst"
+requires-python = ">=3.9"
+license = { file = "LICENSE" }
+authors = [
+    { name = "Dr. Fotsa-Mbogne David Jaures", email = "jauresfotsa@gmail.com" },
+]
+maintainers = [
+    { name = "Dr. Fotsa-Mbogne David Jaures", email = "jauresfotsa@gmail.com" },
+]
+keywords = [
+    "fault tree",
+    "dynamic fault tree",
+    "reliability",
+    "safety",
+    "Hasse diagram",
+    "minimal cut sets",
+    "minimal links",
+    "dependability",
+]
+classifiers = [
+    "Development Status :: 3 - Alpha",
+    "Intended Audience :: Science/Research",
+    "Intended Audience :: Manufacturing",
+    "License :: OSI Approved :: MIT License",
+    "Operating System :: OS Independent",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.9",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Topic :: Scientific/Engineering",
+    "Topic :: Software Development :: Libraries :: Python Modules",
+]
+# Dépendance dure : sympy uniquement (CORRECTION-04 : matplotlib/networkx
+# restent optionnels, chargés paresseusement par ViewGraph).
+dependencies = [
+    "sympy>=1.9",
+]
+
+[project.urls]
+Homepage = "https://github.com/ARDIS4SD/DFT2HD2ReliabilityR"
+Repository = "https://github.com/ARDIS4SD/DFT2HD2ReliabilityR"
+
+[project.optional-dependencies]
+# Visualisation (ViewGraph) — importés paresseusement dans les modules.
+viz = ["matplotlib>=3.5", "networkx>=2.6"]
+# Outillage de test.
+test = ["pytest>=7.0"]
+# Futur lot IA (ANALYSE.md §5, P3) — réservé, à activer lors de l'ajout de ml.py.
+# ml = ["numpy", "scikit-learn"]
+
+[tool.setuptools]
+include-package-data = false
+
+[tool.setuptools.packages.find]
+where = ["src"]
+
+[tool.pytest.ini_options]
+testpaths = ["tests"]
+
+# CORRECTION-12 : base de lint minimaliste pour le legs de code — on intercepte
+# les erreurs de syntaxe/runtime et les pièges critiques sans imposer le style
+# strict aux ~2 500 lignes antérieures (cf. CORRECTIONS.md).
+[tool.ruff]
+line-length = 120
+target-version = "py39"
+
+[tool.ruff.lint]
+select = [
+    "E9",   # erreurs de syntaxe/runtime
+    "F63",  # comparaisons always-true/false accidentelles
+    "F7",   # annotations syntaxiquement invalides
+    "F82",  # variables non définies
+]
+
+[tool.ruff.lint.per-file-ignores]
+# Le legs peut conserver ses longueurs de ligne et imports historiques.
+"src/dft2hd2reliabilityr/*.py" = ["E501"]

dft2hd2reliabilityr-0.2.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

dft2hd2reliabilityr-0.2.0/src/dft2hd2reliabilityr/FaultTreeLib.py

@@ -0,0 +1,291 @@
+# It's a class that creates a directed graph
+"""
+Bibliothèques utiles
+"""
+
+#import plotly.graph_objects as go
+# CORRECTION-04 : matplotlib/networkx sont importés paresseusement dans ViewGraph
+# (deviennent un extra optionnel [viz] pour la publication PyPI).
+from .LogicDoorLib import *  # CORRECTION-11 : imports relatifs au package
+
+"""
+Fault tree construction
+"""
+
+FaultTrees={}
+class FaultTree:
+    NFaultTree=0       
+    def __init__(self,n):
+        """
+        It creates a new object of class Tree, and adds it to the dictionary FaultTreeRs
+        
+        :param n: number of nodes
+        """
+        self.id=id(self)
+        FaultTrees[str(self.id)]=self
+        self.__class__.NFaultTree+=1
+        self.NNode=n # Le système a moins de composant que n
+        self.Node=[]
+        self.Label=[]
+        self.AdjMat={}#matlib.zeros((n, n))
+        self.RelMat=[[],[],[],[],[],[]] 
+        #[[Door],[NodeIn],[NodeOut],[Orders],[Times],[IndicesPrincipal]]
+        self.IdxTable=[[],[],[]] 
+        #[[NumRel],[Node i],[Node j]]
+    
+    def __del__(self):
+        """
+        The __del__ method is called when the instance is about to be destroyed
+        """
+        self.__class__.NFaultTree-=1
+    
+    def IdxNode(self,Indices=None):
+        """
+        It returns the index of the node in the list of nodes
+        
+        :param Indices: The index of the node you want to find
+        :return: The index of the node in the list of nodes.
+        """
+        res=None
+     
+        if (Indices in self.Node):
+            res=0
+            while (self.Node[res]!=Indices):
+                res=res+1
+        return res
+
+    def Root(self):
+        """
+        It returns the roots of the graph.
+        :return: The roots of the graph.
+        """
+        res=[]
+        for i in self.AdjMat.keys():
+            if (sum(self.AdjMat[i])<=self.AdjMat[i][i]):
+                res.append(i)
+        return res
+    
+    def Leaves(self):
+        """
+        The function `Leaves` returns a list of all the leaf nodes in the graph
+        :return: The function `Leaves` returns a list of all the leaf nodes in the graph.
+        """
+        res=[]
+     # Checking if the node is a leaf node.
+        for j in range(len(self.AdjMat)):
+            Temp=0
+            # Iterating over the keys of the dictionary `self.AdjMat`.
+            for i in range(len(self.AdjMat)):
+               # Checking if the node is a leaf node.
+                if (i!=j):
+                    Temp+=self.AdjMat[i][j]
+            if (Temp==0):#((Temp==0) and (self.RelMat[0][j]==1)):
+                res.append(j)
+        return res
+    
+    def Update(self,ID_P=None ):
+        """
+        If the number of nodes is less than the maximum number of nodes, then add the new node to the
+        list of nodes
+
+        CORRECTION-01 (cf. CORRECTIONS.md) : ``ID_P`` devient optionnel et prend ``ID_G``
+        par defaut. Avant, ``NewRelation`` appelait ``self.Update()`` sans argument,
+        donc TOUTE creation de relation levait ``TypeError``.
+        """
+        if ID_P is None:  # CORRECTION-01 : generateur d'etiquettes par defaut
+            ID_P = ID_G
+        n=len(self.RelMat[0])
+        if (n>0):
+            Test=(len(self.Node)<=self.NNode-2)
+            Test=Test or ((self.RelMat[1][-1] in self.Node) and (self.RelMat[2][-1] in self.Node))
+            Test=Test or ((not(self.RelMat[1][-1] in self.Node) or not(self.RelMat[2][-1] in self.Node)) and (len(self.Node)<=self.NNode-1))
+            if not(Test):
+                del(self.RelMat[0][-1])
+                del(self.RelMat[1][-1])
+                del(self.RelMat[2][-1])
+                del(self.RelMat[3][-1])
+                del(self.RelMat[4][-1])
+                del(self.RelMat[5][-1])
+            else:
+                if not(self.RelMat[1][-1] in self.Node):
+                    self.Node.append(self.RelMat[1][-1])
+                    # Appending the label of the node to the list of labels.
+                    self.Label.append(ID_P(1))
+                    for i in range(len(self.Node)-1):
+                        self.AdjMat[i].append(0)
+                    self.AdjMat[len(self.Node)-1]=[0 for i in range(len(self.Node))]
+                if not(self.RelMat[2][-1] in self.Node):
+                    self.Node.append(self.RelMat[2][-1])
+                    # Appending the label of the node to the list of labels.
+                    self.Label.append(ID_P(self.RelMat[0][-1]))
+                    for i in range(len(self.Node)-1):
+                        self.AdjMat[i].append(0)
+                    self.AdjMat[len(self.Node)-1]=[0 for i in range(len(self.Node))]
+                if (self.RelMat[0][-1]>=0):
+                    self.IdxTable[0].append(n-1)
+                    self.IdxTable[1].append(self.IdxNode(self.RelMat[1][-1]))
+                    self.IdxTable[2].append(self.IdxNode(self.RelMat[2][-1]))
+                    self.AdjMat[self.IdxTable[1][-1]][self.IdxTable[2][-1]]=1
+    
+    def InOrder2(self,xx=[1,3,2],yy=[1,2,30]):
+        """
+        The function `InOrder2` takes two lists of numbers as input and returns `True` if the first list
+        is in ascending order and the second list is in descending order
+        
+        :param xx: the list of x-coordinates of the points in the first polygon
+        :param yy: the list of the values of the nodes in the tree
+        :return: True or False
+
+
+        Examples:
+        ---------
+
+        >>> FaultTree.InOrder2(None, [1,3,2], [1,2,30])
+        False
+        """
+        res=True
+        i=0
+        while ((res==True) and (i<min(len(xx),len(yy)))):
+            res=(res and (xx[i]<=yy[i]))
+            i=i+1
+        return res
+   
+    def Sort(self):   
+        """
+        It sorts the relations in the order of the nodes in the graph
+        """  
+        Temp1=[]
+        Temp2=[]
+        for i in range(len(self.IdxTable[0])):
+            j=0
+            for k in range(len(self.IdxTable[0])):           
+                #if (self.InOrder2(self.RelMat[2][k],self.RelMat[1][i]) and (self.IdxTable[2][k]!=self.IdxTable[1][i])):
+                Test=(self.AdjMat[self.IdxNode(self.RelMat[2][k])][self.IdxNode(self.RelMat[1][i])]==1)
+                Test=Test or (self.InOrder2(self.RelMat[2][k],self.RelMat[1][i]))
+                Test=Test and (self.IdxTable[2][k]!=self.IdxTable[1][i])
+                if Test:
+                    j=j+1
+            while (j in Temp1):
+                j=j+1
+            Temp1.append(j)
+            Temp2.append(0)
+        for i in range(len(self.IdxTable[0])):
+            Temp2[int(Temp1[i])]=i
+        Temp3=[[],[],[]]
+        Temp4=[[],[],[],[],[],[]]
+        for i in range(len(self.IdxTable[0])):
+            Temp3[0].append(i)
+            Temp3[1].append(self.IdxTable[1][int(Temp2[i])])
+            Temp3[2].append(self.IdxTable[2][int(Temp2[i])])
+            Temp4[0].append(self.RelMat[0][int(Temp2[i])])
+            Temp4[1].append(self.RelMat[1][int(Temp2[i])])
+            Temp4[2].append(self.RelMat[2][int(Temp2[i])])
+            Temp4[3].append(self.RelMat[3][int(Temp2[i])])
+            Temp4[4].append(self.RelMat[4][int(Temp2[i])])
+            Temp4[5].append(self.RelMat[5][int(Temp2[i])])
+        self.IdxTable=Temp3.copy()
+        self.RelMat=Temp4.copy()
+        
+    def NewRelation(self,Port=1,IndicesIn=None,IndicesOut=None,Orders=None,Times=None,IndicesPrincipal=None):
+        """
+        It takes in a list of lists, and appends a list to the end of the list of lists
+        
+        :param Port: The port number of the relation, defaults to 1 (optional)
+        :param IndicesIn: The indices of the nodes that are input to the relation
+        :param IndicesOut: The indices of the output nodes
+        :param Orders: a list of the orders of the relations
+        :param Times: The time at which the relation is applied
+        :param IndicesPrincipal: This is a list of indices that are the principal indices of the relation
+        """
+        if (IndicesIn!=None) and (IndicesOut!=None):
+            if True:#(len(IndicesIn)==self.NNode) and (len(IndicesOut)==self.NNode):
+                self.RelMat[0].append(Port)
+                self.RelMat[1].append(IndicesIn)
+                self.RelMat[2].append(IndicesOut)
+                self.RelMat[3].append(Orders)
+                self.RelMat[4].append(Times)
+                self.RelMat[5].append(IndicesPrincipal)
+                self.Update()
+                self.Sort()
+        #print(self.RelMat)
+    
+    def ViewGraph(self,ID_P,Dir=None):
+        """
+        It takes a graph and returns a graph with the same nodes and edges, but with the nodes labeled
+        with their index in the original graph.
+        
+        :param Dir: the directory where the graph will be saved
+        """
+        # CORRECTION-04 : import paresseux de la pile graphique optionnelle
+        try:
+            import networkx as nx
+            import  matplotlib.pyplot  as  plt
+        except ImportError as exc:
+            raise ImportError(
+                "ViewGraph requires the optional visualization extras: "
+                "pip install matplotlib networkx"
+            ) from exc
+        G=nx.DiGraph()
+        GNode={}
+        nn=len(self.Node)
+        for i in self.AdjMat.keys():
+            for j in range(len(self.AdjMat[i])):
+                if (self.AdjMat[i][j]==1):
+                    GNode[nn-1-self.IdxNode(self.Node[i])]=str(nn-1-self.IdxNode(self.Node[i]))+':'+self.Label[i]
+                    GNode[nn-1-self.IdxNode(self.Node[j])]=str(nn-1-self.IdxNode(self.Node[j]))+':'+self.Label[j]
+                    G.add_edge(GNode[nn-1-self.IdxNode(self.Node[i])],GNode[nn-1-self.IdxNode(self.Node[j])])
+                    #G.add_edge(str(nn-1-self.IdxNode(self.Node[i]))+':'+self.Label[i],str(nn-1-self.IdxNode(self.Node[j]))+':'+self.Label[j])
+                    #G.add_edge(str(self.Node[j]),str(self.Node[i]))
+        #CompleteNode=self.Node.copy()
+        
+        mm=nn
+        for i in range(nn):
+            #print("yeah !")
+            #print(self.Node[i])
+            for j in range(nn):
+                if (i!=j) and self.InOrder2(self.Node[i],self.Node[j]):
+                    G.add_edge(GNode[nn-1-self.IdxNode(self.Node[i])],GNode[nn-1-self.IdxNode(self.Node[j])])
+            for j in range(self.NNode):
+                Temp=[0 for k in range(self.NNode)]
+                Temp[j]=1
+                if (self.InOrder2(Temp,self.Node[i])) and (Temp!=self.Node[i]):
+                    #print(Temp)
+                    if not(Temp in self.Node):
+                        # Adding a node to the graph.
+                        GNode[mm]=str(mm)+':'+ID_P(1)
+                        G.add_edge(GNode[mm],GNode[nn-1-self.IdxNode(self.Node[i])])
+                        mm+=1
+                        #G.add_edge(str(self.Node[i]),str(Temp))
+                    #CompleteNode.append(Temp)
+        
+        #print(G.adj)
+        #fig=plt.figure(figsize=(5,5))
+        plt.subplots(figsize=(10, 10))
+        plt.clf() # Efface le contenu de la figure courante
+        nx.draw_networkx(G,pos=nx.circular_layout(G),node_size=(10**4)/2)
+        #nx.draw(G)
+        #nx.draw(G,pos=nx.circular_layout(G),node_color='r',edge_color='b')
+        plt.axis('off')
+        #plt.grid(False)
+        if (Dir!=None):
+            plt.savefig(Dir+"AD.png")
+            plt.savefig(Dir+"AD.pdf",format="pdf")
+        plt.show()
+        
+"""
+Dir="E:/Pedagogie/Encadrement/EncadrementEnsai/MasterRThese/20192020/TadieBenjaulys/"
+MyTree=FaultTree(2)
+#MyTree.NewRelation(1,[1,0],[1,0])
+#MyTree.NewRelation(1,[0,1],[0,1])
+MyTree.NewRelation(4,[0,1],[1,1])
+MyTree.NewRelation(3,[1,1],[1,1])
+
+print(MyTree.NNode)
+print(MyTree.Leaves())
+print(MyTree.Node)
+print(MyTree.IdxTable)
+print(MyTree.RelMat)
+print(MyTree.AdjMat)
+print(MyTree.Root())
+MyTree.ViewGraph(Dir)
+"""