Hi igraphers!
I've some questions about weighted networks in igraph:
1. Working with the Python interface, I would like to generate a directed weighted graph (without multiple edges and self-loops) from an adjacency matrix, where the elements of the matrix store the weight if an edge exists and are otherwise zero. The matrix is a numpy array or list of lists. How can this be achieved in a most direct way?
HI Jonathan,
Unfortunately there is no direct method to this according to my knowledge you are better of converting your matrix into the ncol format.
which is a normal text list of
node-from node-to weight