_tracemin_fiedler(L, X, normalized, tol, method)
The Fiedler vector of a connected undirected graph is the eigenvector corresponding to the second smallest eigenvalue of the Laplacian matrix of the graph. This function starts with the Laplacian L, not the Graph.
This function allows more than one column in X to identify more than one eigenvector if desired.
Whether the normalized Laplacian matrix is used.
Tolerance of relative residual in eigenvalue computation. Warning: There is no limit on number of iterations.
Should be 'tracemin_pcg' or 'tracemin_lu'. Otherwise exception is raised.
The lowest eigenvalues and corresponding eigenvectors of L. The size of input X determines the size of these outputs. As this is for Fiedler vectors, the zero eigenvalue (and constant eigenvector) are avoided.
Compute the Fiedler vector of L using the TraceMIN-Fiedler algorithm.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them