Laplacians.jl
  • About
  • Manual
    • Installation
    • Examples
    • Sparse matrices as graphs
    • Solving Linear Equations
    • Low Stretch Spanning Trees
  • Developing
  • API
    • generators
    • operators
    • graphUtils
    • graphAlgs
    • IO
    • solvers
    • sparsification
    • akpw
    • treeAlgs
    • randTrees
    • localClustering
    • Private Functions
    • All of the above
Version
  • API
  • treeAlgs
  • treeAlgs
Edit on GitHub

Tree Algorithms

  • Laplacians.comp_stretches
Laplacians.comp_stretches — Method

Compute the stretched of every edge in mat with respect to the tree tree. Returns the answer as a sparse matrix with the same nonzero structure as mat. Assumes that mat is symmetric. tree should be the adjacency matrix of a spanning tree.

source
« akpwrandTrees »

Settings


This document was generated with Documenter.jl on Monday 19 May 2025. Using Julia version 1.11.5.