Convert an adjacency matrix (ie - from the sparseiCov
function) to an igraph object
adj2igraph(Adj, rmEmptyNodes = FALSE, diag = FALSE,
edge.attr = list(), vertex.attr = list(name = 1:ncol(Adj)))
an Adjacency matrix
should unconnected nodes be removed from the graph
Flag to include self-loops (diagonal of adjacency matrix)
named list of attributes for graph edges
named list of attributes for graph vertices