(self, l=0, considerLongerPaths=True)
return L
Returns the number of unique paths of a given length l (and possibly longer)

        @param l: the (inclusive) maximum length up to which path shall be counted.
Returns the number of unique paths of a given length l (and possibly longer)
Returns the number of unique paths of a given length l ( and possibly longer )
def getUniquePaths(self, l=0, considerLongerPaths=True):
        """
        Returns the number of unique paths of a given length l (and possibly longer)

        @param l: the (inclusive) maximum length up to which path shall be counted. 
        """
        L = 0
        lmax = l
        if considerLongerPaths:
            if len(self.paths)>0:
                lmax = max(self.paths)
            else:
                lmax = 0
        for j in range(l, lmax+1):
            for p in self.paths[j]:
                if self.paths[j][p][1]>0:
                    L += 1
        return L
def getUniquePaths ( self , l = 0 , considerLongerPaths = True ) : L = 0 lmax = l if considerLongerPaths : if len ( self . paths ) > 0 : lmax = max ( self . paths ) else : lmax = 0 for j in range ( l , lmax + 1 ) : for p in self . paths [ j ] : if self . paths [ j ] [ p ] [ 1 ] > 0 : L += 1 return L