(self)
return v[:,_np.argsort(_np.absolute(w))][:,1]
Returns the (dense)Fiedler vector of the higher-order network. The Fiedler 
         vector can be used for a spectral bisectioning of the network.
Returns the (dense)Fiedler vector of the higher-order network. The Fiedler 
         vector can be used for a spectral bisectioning of the network.
Returns the ( dense ) Fiedler vector of the higher - order network . The Fiedler vector can be used for a spectral bisectioning of the network .
def getFiedlerVectorDense(self):
        """
         Returns the (dense)Fiedler vector of the higher-order network. The Fiedler 
         vector can be used for a spectral bisectioning of the network.             
        """
    
        # NOTE: The Laplacian is transposed for the sparse case to get the left
        # NOTE: eigenvalue.
        L = self.getLaplacianMatrix()
        # convert to dense matrix and transpose again to have the untransposed
        # laplacian again.
        w, v = _la.eig(L.todense().transpose(), right=False, left=True)

        return v[:,_np.argsort(_np.absolute(w))][:,1]
def getFiedlerVectorDense ( self ) : # NOTE: The Laplacian is transposed for the sparse case to get the left # NOTE: eigenvalue. L = self . getLaplacianMatrix ( ) # convert to dense matrix and transpose again to have the untransposed # laplacian again. w , v = _la . eig ( L . todense ( ) . transpose ( ) , right = False , left = True ) return v [ : , _np . argsort ( _np . absolute ( w ) ) ] [ : , 1 ]