search for: digraphs

Dear R users, I have a matrix with 2 columns with the variables: "daughter index", "mother index". I would like to draw a network digraph using this data, where each daughter is connected to a mother and between the connections inlcude a circle with the information on the indices ("daughter index", "mother index"): i.e. something similar to graphs

Hi Guus, I've been a huge fan of the GraphDumpFile parameter in tinc -- it certainly beats sending USR2 to tincd, and ploughing through syslog to figure out which nodes are connected. Could I request that GraphDumpFile dumps a little more data to the file, namely, the subnet; changing the output file from (for example): digraph { nodeA [label = "nodeA"];

Aloha all, I have an adjacency matrix for an acyclic digraph that contains transitive relations, e.g. (u,v), (v,w), (u,w). I want a DAG with only intransitive relations. Can someone point me to an R function that will take my adjacency matrix and give me back one with only intransitive relations? In the example, I'd like to get rid of (u,w) and keep (u,v) and (v,w). All the best, Tom --

I'm developing the ABCD algorithm for LLVM, and I will need to store some information as a digraph. I was thinking of a list of adjacency, implemented with a map<Instruction, Set<Node>>. The node would have an Instruction and a value. I opted for map and set, because I will create the graph once and will search on it a bunch of times, and will never remove a node. Is there

...ess of the -std=... specified in commandline. Also in file "include/clang/Basci/LangStandards.def" CLANG has aliased c++98 and c++03. // C++ modes LANGSTANDARD(cxx98, "c++98", CXX, "ISO C++ 1998 with amendments", LineComment | CPlusPlus | Digraphs) LANGSTANDARD_ALIAS(cxx98, "c++03") So, my query is that since, c++98 and c++03 is mostly same assuming CLANG Frontend. Should we also support DW_LANG_C_plus_plus_03 ? for -std=c++03 in Frontend or let it remain alias of c++98. LLVM AsmPrinters has already code for supporting these new...

On Thu, Jun 16, 2016 at 10:47 PM, Sean Silva <chisophugis at gmail.com> wrote: > > > On Thu, Jun 16, 2016 at 9:53 PM, Xinliang David Li <davidxl at google.com> > wrote: > >> >> >> On Thu, Jun 16, 2016 at 11:12 AM, Sanjoy Das < >> sanjoy at playingwithpointers.com> wrote: >> >>> Hi Sean, >>> >>> On Thu, Jun

Estimados Copio un mensaje de error que da igraph, es más fácil verlo que explicarlo. > fastgreedy.community(udatos) Error in .Call("R_igraph_community_fastgreedy", graph, as.logical(merges), : At fast_community.c:553 : fast-greedy community finding works only on graphs without multiple edges, Invalid value > cluster_louvain(udatos) IGRAPH clustering multi level, groups: 7,

Thanks, very informative! I was able to generate this digraph and I'm pleased with it since it appears that all my servers behind bastion are directly connected, but nodes outside are not and are routed via bastion http://imgur.com/zEojkMw Here is the digraph itself, if the above link is not accessible: digraph { bastion [label = "bastion", color = "green"];

On Monday 06 July 2009 14:32, Andre Tavares wrote: > I'm developing the ABCD algorithm for LLVM, and I will need to store > some information as a digraph. > > I was thinking of a list of adjacency, implemented with a > map<Instruction, Set<Node>>. The node would have an Instruction and a > value. I opted for map and set, because I will create the graph once and

Hi all, Thought this might be of general interest, I hacked up the pybugz tool to work with llvm.org. It's here if you want it: http://t1.minormatter.com/~ddunbar/pybugz-llvm-0.7.3.tgz Unpack somewhere, and make a link to the 'bugz' script. Usage: -- ddunbar at ozzy-2:~$ bugz get 1000 * Using http://llvm.org/bugs/ * Getting bug 1000 .. Title : Chris Is Buggy Assignee :

I just got this error: > library(igraph) > comp <- decompose.graph(gr) Error: protect(): protection stack overflow Error: protect(): protection stack overflow > what can I do? the digraph is, indeed, large (300,000 vertexes), but there are very many very small components (which I would rather not discard). PS. the doc for decompose.graph does not say which mode is the default. --

I'm using specify.model for the sem package. I can't figure out how to represent the residual errors for the observed variables for a CFA model. (Once I get this working I need to add some further constraints.) Here is what I've tried: model.sa <- specify.model() F1 -> X1,l11, NA F1 -> X2,l21, NA F1 -> X3,l31, NA F1 -> X4,l41, NA F1 -> X5, NA, 0.20

On Thu, Jun 16, 2016 at 11:51 PM, Sean Silva <chisophugis at gmail.com> wrote: > > > On Thu, Jun 16, 2016 at 11:07 PM, Xinliang David Li <davidxl at google.com> > wrote: > >> >> >> On Thu, Jun 16, 2016 at 10:47 PM, Sean Silva <chisophugis at gmail.com> >> wrote: >> >>> >>> >>> On Thu, Jun 16, 2016 at 9:53

On Thu, Jun 16, 2016 at 11:12 AM, Sanjoy Das <sanjoy at playingwithpointers.com > wrote: > Hi Sean, > > On Thu, Jun 16, 2016 at 4:48 AM, Sean Silva via llvm-dev > <llvm-dev at lists.llvm.org> wrote: > > One question is what invariants we want to provide for the visitation. > > > > For example, should a CGSCC pass be able to assume that all

Hi, all: Recently I am debugging the DSA and want to learn how it work, and now I am checking the local datastructure analysis. I use the following command to print the graph: (gdb) p g.dump() digraph DataStructures { label="Function addG"; Node0xe1f3a0 [shape=record,shape=Mrecord,label="{ i32: MRE\n|{<g0>}}"]; Node0xe1f4d0

Hi All, Apologies if this has been answered somewhere else, but I have been searching for an answer all day and not been able to find one. I am trying to plot a path diagram for a CFA I have run, I have installed Rgraphviz and run the following: pathDiagram(cfa, min.rank='item1, item2, item3, item4, item5, item6, item7, item8, item9, item10, item11, item12', max.rank='SMP,

Hello all, I just wanted to share a small perl script that generates a dot file from the result of the R profiler. The dot file can than be used to create a graphical display of the profiling. You can save this file in the bin directory of your R installation and then create a graph, for example an SVG by piping the output of the script to dot: $ R CMD Rprof2dot Rprof.out | dot -Tsvg >

On Thu, 9 Nov 2006, Ryan M. Lefever wrote: Sorry I never responded to this: > In the literature (see below for a reference), when a dominance frontier > is computed, it is computed from a CFG that contains a dummy entry node > and dummy exit node. Further, those dummy nodes are potential members > of the (post-)dominance frontier for a given basic block. In LLVM, I > could not

Hi I'm new to tinc vpn and I am currently exploring a use-case we have, of creating a secure mesh over which our own services may run. This may be a basic question, I wasn't able to find a satisfying answer. What is the significance of port 655 with regards to tinc? Lets consider a 4 node setup: We have nodes: [protected] : protected behind a private network in the cloud [bastion]:

In the literature (see below for a reference), when a dominance frontier is computed, it is computed from a CFG that contains a dummy entry node and dummy exit node. Further, those dummy nodes are potential members of the (post-)dominance frontier for a given basic block. In LLVM, I could not figure out a way to determine if the dummy entry node is a member of the post-dominance frontier of