clp

@[jessexknight](https://github.com/jessexknight), note that: `i.adj = c(ii.e[ii.e[,1] %in% i,2], ii.e[ii.e[,2] %in% i,1])` is limited to undirected graphs. For directed graphs, the adjacent vertices must be selected by: `c(t(ii.e[which(ii.e[,1]==i),]))`

> The bad performance is not in the C core but in creating vertex sequences, which is slow. Setting `igraph_options(return.vs.es=F)` will make it fast. Observe the following difference in performance:...

Hello, Found this one: ``` make_full_citation_graph(n=.Machine$integer.max - 1 ) # crash

Thanks for pointing out the typo and the explanation of the error message regarding the negative number of vertices. This leaves: require(igraph) make_full_citation_graph(n=NULL) # crash Igraph version: 1.2.8

System Info: R version 4.1.2 (2021-11-01) Platform: x86_64-w64-mingw32/x64 (64-bit) Running under: Windows 10 x64 (build 22000) [1] igraph_1.2.11 system.time(make_full_citation_graph(n=44500)) gives ---> Error in make_full_citation_graph(n = 44500) : At vector.pmt:446 :...

The R doc is rather sparse. In [igraph Reference Manual, Chapter 14. Graph visitors](https://igraph.org/c/doc/igraph-Visitors.html) we read: > If not all vertices can be reached from the supplied root vertex, then...

Everything is possible with a Turing machine. The proposed solution is not entirely intuitive. I'm looking for something like s

The functions read.csv(), write.csv() output to a string with text = s. It is not a new functionality.

Try: ``` g

I have tried: ` read_graph(rawConnection(charToRaw('graph [ directed 0 node [ id 1 ] node [ id 2 ] edge [ source 1 target 2 ] ]')), 'gml')` The result is:...