Apparently libigraph and python-igraph are the only packages on earth that can't be installed via apt-get or easy_install under Ubuntu 8.04 LTS 64-bit. Installing both from source from source on seems to go smoothly...until I try to use them. When I run python I get: >>> import igraph Traceback (most recent call last): File "<stdin>...
I have a data.frame with 2 columns: Node A, Node B. Each entry in the frame implies an edge in a graph between node A and B. There must be a nice one-liner to convert this data.frame into an adjacency list. Any hints? ...
I have a network loaded into an igraph object G that has 198 vertices and 214 edges. If I run: eig<-evcent(G)$vector The resulting eig is a vector with 2172 elements, rather than 198 elements. The documentation on the package claims it returns the "centralities of positions v." Any ideas on how to get the eigenvalue centralities f...
I want to construct a new centrality measure using igraph, preferably in R. How would I begin this? For example, would I be better adding to the igraph C library or the R interface? Thanks Conor ...
I wanted to visualize a network with the data I have and would like to graph them with specific edge lengths. I use Python, and I've tried networkx and igraph to plot but all seem to assign fixed edge lengths. a.) I wonder if I did the codes wrong or the packages aren't really capable. How do you properly implement specified edge lengt...
I have data in the below form, which makes up a bipartite network. A1 - B1 A2 - B2 A2 - B1 A3 - B1 A4 - B2 A5 - B3 A6 - B3 A7 - B3 A7 - B3 A8 - B4 A9 - B3 What I would like to do is write something (ideally in python or C) or use an existing library to identify individual communities within the data. For instance A1,A2,A3,A4 are all ...
I would like to lay out graphs (trees) with two types of nodes: boxes and circles. Is this possible with igraph and how would a minimal example look like? ...
It is very straight-forward to plot a tree using igraph in R library(igraph) plot(graph.tree(20, 2), layout=layout.reingold.tilford) Is it possible to "turn the graph around", so that the root (node 0) is at the top of the plot? Or, alternatively, is it possible to put the root to middle left? ...
Hi! I would like to have a manager process sharing graphs via shared memory, read-only for other processes which will run various graph algorithms on these graphs. I would like to ask some questions emerged while researching the issue: Are there any graph libraries which are able to operate on (possibly their own) graph structures in r...
Say I have this example graph, i want to find the edges connected to vertex 'a' d <- data.frame(p1=c('a', 'a', 'a', 'b', 'b', 'b', 'c', 'c', 'd'), p2=c('b', 'c', 'd', 'c', 'd', 'e', 'd', 'e', 'e')) library(igraph) g <- graph.data.frame(d, directed=FALSE) print(g, e=TRUE, v=TRUE) I can easily find a vertex: V(g)[V(...
Hi, everybody! My question is the following: Consider a undirect graph with 10000 nodes and 4800 edges. Given this graph and given a node of this graph (for example, node 1), I need a command in igraph (R) to obtain the distance between this node 1 and the farest node in the graph, please. Thanks a lot, for your help! :) Kind regards, ...
Hy Everybody! Well, I'm working with the Igraph package, and i'd like to pick the edges by the name that I've assigned to their vertex, in a tiny example.. library(igraph) g <- barabasi.game(8) labels<-c("G1","G2","G3","T1","T2","T3","H1","H2") V(g)$name<-labels Now My edge list hast this form > E(g) Edge sequence: [0] G2 ->...
Dear Pythonistas, I have downloaded the igraph 0.5.4 tar ball for macosx Leopard 10.5.8. When I unpack it and then run: sudo python setup.py install I get the following long error message: Include path: /usr/include /usr/local/include Library path: running install running bdist_egg running egg_info writing python_igraph.egg-inf...
mincut_value in igraph for python returns the number of edges of the cut. Can I find the what edges are actually are returned by this function and print them??? Thank you, ...
I use python binding to igraph to represent a directed tree. I would like to find all possible paths from one node in that graph to another one. Unfortunately, I couldn't find a ready to use function in igraph that performs this task? EDIT The concerns on infinite number of paths the graph I'm talking about is actually a directed ac...