search for: graphml

...a at redhat.com> wrote: > > On 10/09/2017 11:16 AM, Paul Smith wrote: >> >> I am trying to install >> >> igraph package >> >> but getting the following error: >> >> ------------------ >> make: *** [/usr/lib64/R/etc/Makeconf:159: foreign-graphml.o] Error 1 >> ERROR: compilation failed for package ?igraph? >> * removing ?/usr/lib64/R/library/igraph? >> ------------------ >> >> Any ideas? > > Need to see a lot more logs, specifically, the items before that Error > occurs. Thanks, Tom. Below, you can fi...

Dear All, I am trying to install igraph package but getting the following error: ------------------ make: *** [/usr/lib64/R/etc/Makeconf:159: foreign-graphml.o] Error 1 ERROR: compilation failed for package ?igraph? * removing ?/usr/lib64/R/library/igraph? ------------------ Any ideas? Thanks in advance, Paul

Hello, Could you please test the solution at https://stackoverflow.com/questions/45318188/getting-error-in-function-igraph-write-graph-graphml-while-installing-igrap Specifically - install.packages("devtools") library(devtools) install_github("igraph/rigraph") Please let us know if this works Regards, -- Saint Pai On Tue, Oct 10, 2017 at 01:40:53AM +0100, Paul Smith wrote: > On Mon, Oct 9, 2017 at 4:42 PM, Tom...

I'm interested in using R's plotting capabilities to try to generate a graph showing the relationship/pairing frequency of words appearing in a block of unstructured text. I don't have a specific algorithm or approach in mind, just looking to portray text in an interesting fashion. The output I'm hoping for is something like the following called a "Phrase Network":

Hello Everyone! This is my first post to the mailing list so please forgive me if I am a bit deflected from the general format of this mailing list posts. Since I need help in this matter urgently, I would cover up any of my mistakes in posting later. That said, I have a problem in merging 2 graphs that have common nodes between them. I have a graph G1, that have nodes N1 and edge set E1 and

..._1, node_2, dissimilarity] format. I would like to visualize this as a graph in Euclidean space (that is, similar nodes clumped together in clusters), rather than the seriation visualization given by dissplot(). I am using Network WorkBench for my visualizations and thus want the R output to be in graphml. If I use, say, graph.data.frame(), it will read the dissimilarity column as an edge attribute rather than as distance between nodes, which is what I want. How should I go about this? Many thanks! [[alternative HTML version deleted]]

Estimados compañeros estoy con un trabajo sobre redes pathfinder y quería saber si conocéis alguna librería o función para dada la matriz de proximidades sacar la matriz de la red pathfinder. Un cordial saludo y un mejor año 2013. Juan -- ========================================================= Juan Antonio Gil Pascual Prof. Titular de Metodología Cuantitatíva correo: jgil en edu.uned.es

...e included, plus many more. - Functions for graph and subgraph isomorphism, the BLISS and the VF2 algorithms are included. - Functions for maximal network flows, minimal cuts, vertex and edge connectivity. - igraph can read and write many popular file formats used for storing graph data: GraphML, Pajek, GML and others. - igraph contains implementations of many community structure detection algorithms proposed recently. See more at the igraph homepage: http://cneurocvs.rmki.kfki.hu/igraph/index.html -- Csardi Gabor <csardi at rmki.kfki.hu> _____________________________________...

...e included, plus many more. - Functions for graph and subgraph isomorphism, the BLISS and the VF2 algorithms are included. - Functions for maximal network flows, minimal cuts, vertex and edge connectivity. - igraph can read and write many popular file formats used for storing graph data: GraphML, Pajek, GML and others. - igraph contains implementations of many community structure detection algorithms proposed recently. See more at the igraph homepage: http://cneurocvs.rmki.kfki.hu/igraph/index.html -- Csardi Gabor <csardi at rmki.kfki.hu> _____________________________________...

...o dsapps.o dsaup2.o dsaupd.o dsconv.o dseigt.o dsesrt.o dseupd.o dsgets.o dsortc.o dsortr.o dstatn.o dstats.o dstqrb.o dvout.o eigen.o error.o evolver_cit.o f2c_dummy.o fast_community.o feedback_arc_set.o flow.o foreign-dl-lexer.o foreign-dl-parser.o foreign-gml-lexer.o foreign-gml-parser.o foreign-graphml.o foreign-lgl-lexer.o foreign-lgl-parser.o foreign-ncol-lexer.o foreign-ncol-parser.o foreign-pajek-lexer.o foreign-pajek-parser.o foreign.o forestfire.o fortran_intrinsics.o games.o gengraph_box_list.o gengraph_degree_sequence.o gengraph_graph_molloy_hash.o gengraph_graph_molloy_optimized.o gengra...

...ms are included, plus many more. - Functions for graph and subgraph isomorphism, the BLISS and the VF2 algorithms are included. - Functions for maximal network flows, minimal cuts, vertex and edge connectivity. - igraph can read and write many popular file formats used for storing graph data: GraphML, Pajek, GML and others. - igraph contains implementations of many community structure detection algorithms proposed recently. -- Gabor Csardi <Gabor.Csardi at unil.ch> UNIL DGM _______________________________________________ R-packages mailing list R-packages at r-project.org https:/...

...ms are included, plus many more. - Functions for graph and subgraph isomorphism, the BLISS and the VF2 algorithms are included. - Functions for maximal network flows, minimal cuts, vertex and edge connectivity. - igraph can read and write many popular file formats used for storing graph data: GraphML, Pajek, GML and others. - igraph contains implementations of many community structure detection algorithms proposed recently. -- Gabor Csardi <Gabor.Csardi at unil.ch> UNIL DGM _______________________________________________ R-packages mailing list R-packages at r-project.org https:/...