igraph

Given a graph G, a node n and a length L, I'd like to collect all (non-cyclic) paths of length L that depart from n. Do you have any idea on how to approach this? By now, I my graph is a networkx.Graph instance, but I do not really care if e.g. igraph is recommended. Thanks a lot! I would just like to expand on Lance Helsten's excellent answer: The depth-limited search searches for a particular node within a certain depth (what you're calling the length L), and stops when it finds it. If you will take a look at the pseudocode in the wiki link in his answer, you'll understand this: DLS(node,

if I make a graph g : g <- read.table(text=" A B W 1 55 3 2 55 5 3 99 6 ",header=TRUE) library(igraph) g <- graph.data.frame(g) and matrix of coordinates: y<-1:5 x<-c(0.1,0.1,0.2,0.2,0.8) l<-data.frame(x,y) l<-as.matrix(l) I can plot the graph with node positions according to custom coordinates and plot axes. plot(g,layout=l,rescale=F,axes=TRUE,ylim=c(0,6),xlim=c(0,1)) But the xaxis limits do not function properly and I think are altered by yaxis limits. How can I control the xaxis they way i want for instance keeping it between 0 and 1. i.e. plot(x,y,xlim=c(0,1),ylim=c(0,6)) Is this a bug? If

I am trying to build graphs using tree-like data, where nodes typically split into >2 edges. I have tried various layouts, and I see that the layout.reingold.tilford parameter will generate tree-like graphs with non-bifurcating data. However the outputs are not particularly attractive. I would rather use something like the layout.lgl or layout.kamada.kawai since these produce more radial structures. I cannot see how to change the parameters in R such that these trees have no overlapping edges though. Is this possible? I imported a simple data file in Pajek format, with 355 nodes and 354 edges.

My problem is very simple: I need to create an adjacency list/matrix from a list of edges. I have an edge list stored in a csv document with column1 = node1 and column2 = node2 and I would like to convert this to a weighted adjacency list or a weighted adjacency matrix. To be more precise, here's how the data looks like -where the numbers are simply node ids: node1,node2 551,548 510,512 548,553 505,504 510,512 552,543 512,510 512,510 551,548 548,543 543,547 543,548 548,543 548,542 Any tips on how to achieve the conversion from this to a weighted adjacency list/matrix? This is how I resolved to

I can use the code below to generate and draw communities: wc <- walktrap.community(subgraph) modularity(wc) membership(wc) layout <-layout.fruchterman.reingold(subgraph) plot(wc, subgraph, layout=layout, vertex.label=NA, vertex.size=5, edge.arrow.size=.2) However, the colors of the communities are automatic, I have two questions: Could I custom the community color? Could I add some text in the community area? Yes, you can do both of those things. Changing the colors of the nodes according to which module they are in (as well as changing the colors of the polygons around the modules) is