Home | Trees | Indices | Help |
---|
|
Date: $Date: 2005-06-15 08:53:26 -0600 (Wed, 15 Jun 2005) $
Author: Aric Hagberg (hagberg@lanl.gov) Dan Schult(dschult@colgate.edu)
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
__credits__ =
|
|||
__revision__ =
|
|||
__warningregistry__ =
|
|
Circular layout. Crude version that doesn't try to minimize edge crossings. |
Shell layout. Crude version that doesn't try to minimize edge crossings. nlist is an optional list of lists of nodes to be drawn at each shell level. Only one shell with all nodes will be drawn if not specified. |
Power Iteration method to find smallest eigenvectors of Laplacian(G). Note: constant eigenvector has eigenvalue=0 but is not included in the count of smallest eigenvalues. uhat -- list of p initial guesses (dicts) for the p eigenvectors. G -- The Graph from which Laplacian is calculated. eps -- tolerance for norm of change in eigenvalue estimate. iterations -- maximum number of iterations to use. |
Return a list of matrix properties to be used to iteratively multiply B*v where v is a vector and B=g*I-L and g is the Gershgorin estimate of the largest eigenvalue of L=Laplacian(G). Used as input to graph_gershgorin_dot_v() |
Returns B*v where B=g*I-L and g is the Gershgorin estimate of the largest eigenvalue of L. (g=max( deg(n) + sum_u(|w_(n,u)|) We use this to iterate and find the smallest eigenvectors of L. |
|
__warningregistry__
|
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0beta1 on Sun Aug 17 12:04:43 2008 | http://epydoc.sourceforge.net |