Compute the reordering using the GMRFLib implementation

This function compute the reordering (or find the best reordering) using the GMRFLib implementation

inla.qreordering(graph, reordering)

Arguments

graph: A (inla-)graph object, a filename containing the graph or a matrix/Matrix defining it.
reordering: The type of reordering algorithm to be used; either one of the names listed in inla.reorderings(). The default is "auto" which try several reordering algorithm and use the best one for this particular matrix.

Value

inla.qreordering returns a list with the name of the reordering algorithm used or found, the reordering code for the reordering algorithm, the actual reordering and its inverse.

Author

Havard Rue hrue@r-inla.org

Examples

 g = system.file("demodata/germany.graph", package="INLA")
 r = inla.qreordering(g)
#> Error in system(paste(shQuote(inla.call.no.remote()), "-s -m qreordering",     "-r", reordering, "-S", "taucs", g.file), intern = TRUE): error in running command
 m = inla.graph2matrix(g)
 r = inla.qreordering(m)
#> Error in system(paste(shQuote(inla.call.no.remote()), "-s -m qreordering",     "-r", reordering, "-S", "taucs", g.file), intern = TRUE): error in running command
 m.file = INLA:::inla.write.fmesher.file(m)
 r = inla.qreordering(m.file)
#> Error in system(paste(shQuote(inla.call.no.remote()), "-s -m qreordering",     "-r", reordering, "-S", "taucs", g.file), intern = TRUE): error in running command
 unlink(m.file)