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
  • akpw
  • akpw
Edit on GitHub

AKPW

Also see the page on Low Stretch Spanning Trees

  • Laplacians.akpw
  • Laplacians.akpwU
Laplacians.akpw — Method
tree = akpw(graph; ver=0)

Computes a low stretch spanning tree of graph, and returns it as a graph. The default version is 0. In event of emergency, one can try ver=2. It is usually slower, but might have slightly better stretch.

source
Laplacians.akpwU — Method
tree = akpwU(graph)

Computes a low stretch spanning tree of an unweighted graph, and returns it as a graph.

source
« sparsificationtreeAlgs »

Settings


This document was generated with Documenter.jl on Thursday 27 July 2023. Using Julia version 1.9.2.