`TransportMaps.Algorithms.SparsityIdentification.NodeOrdering`¶

This file includes multiple ways to reorder the graph nodes, including reverse cholesky, min-fill, and min-degree.

Module Contents¶

Classes¶

`ReverseCholesky`
`MinFill`
`MinDegree`

class TransportMaps.Algorithms.SparsityIdentification.NodeOrdering.ReverseCholesky[source]¶

perm(gp)[source]¶

invPerm(gp)[source]¶

class TransportMaps.Algorithms.SparsityIdentification.NodeOrdering.MinFill[source]¶

perm(gp)[source]¶

invPerm(gp)[source]¶

class TransportMaps.Algorithms.SparsityIdentification.NodeOrdering.MinDegree[source]¶

perm(gp)[source]¶

invPerm(gp)[source]¶