Has internal rules for converting various graph topologies into the associated adjancency and, therefore, precision matrix
graph2prec(Graph, posThetaLims = c(2, 3), negThetaLims = -posThetaLims,
targetCondition = 100, epsBin = 0.01, numBinSearch = 100)
graph adjacency matrix
length 2 vector of lower and upper bound of positive values
length 2 vector of lower and upper bound of negative values
sets the condition of the precision matrix by modulating the magnitude of the diagonal
the convergence tolerance of the condition number binary search
maximum number of iterations