thanks. I had read through igraph.plotting but not recognized this possibilityIf you have the 'x' and 'y' coordinates in the corresponding attributes, then do
plot(g, layout=cbind(V(g)$x, V(g)$y))
[...]
in my case it makes sense (see attached example, since the tunnels are curved I have to add degree-2 nodes simply to model this geometric constraint). But when it comes to identify the bifurcations and the geometric distance between them I thought that I could use the delete.vertices function in order to create the network without degree-2 nodes, assess the topological distance from the origin (as in the Horton Strahler index in river networks) and then come back to the original network in order to compute this geometric distance. Well, I understand now that I have to program this myself, no problem.Why should it reconnect the neighbor vertices? Graphs usually
represent parts of a real system, and the relationships between them.
E.g. people and friendship in case of a social network. If we remove a
person for some particular reason, then why should we reconnect the
network? Her friends do not became friends, just because we removed
her from the network.
I agree that is some special cases it might make sense to reconnect
it, but IMHO in general it does not.Just a final question: when testing/treating for example edge 2> E(g)[2]Edge sequence:ee [2] 4 -- 0how do I extract the numbers 4 and 0 ? I tried things like E(g)[2][1] or E(g)[2][[1]], but so far I havn't gotten it working.Maybe there is another function in igraph to extract the vertice numbers to which an edge is connected?
Please see ?get.edges.
Best,
G.
Thanks in advance, Christian.