Hi,
What does " : " notation means in graph.formula : notation?
thanks in advance
RAE
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
31 43
7 23 94 106
8 36 55 111
9 3 23 29
...
where nid is the person’s ID and norm1 , norm 2... are the nominations to
other IDs
thanks in advance
Ragia
ot; )
and got the following Error
Error in .Call("R_igraph_read_graph_dl", file, as.logical(directed), PACKAGE =
"igraph") :
At foreign.c:3039 : syntax error, unexpected EOFF, expecting NEWLINE or DIGIT
in line 1, Parse
ot;, file, as.logical(directed), PACKAGE =
"igraph") :
At foreign.c:3062 :More vertices than specified in `DL' file
what should i do to make it work?
thanks
RagiA
> Date: Thu, 3 Mar 2016 09:45:46 +0100
> From: nta...@rmki.kfki.hu
>
raph_read_graph_dl", file, as.logical(directed), PACKAGE =
"igraph") :
At foreign.c:3062 :More vertices than specified in `DL' file
what should i do to make it work?
thanks
Ragia
___
igraph-h
appropriate time.
thanks in advance
Ragia
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
Hello,
kindly,
How can I convert convert vector of node's ides into vertices object
""igraph.vs".
thanks in advance
Regardes,
Ragia
___
igraph-help mailing list
igraph-help@nongnu.org
http
h the contraction phase
all.vertices <- (1:vcount(graph)) - 1
es <- E(graph) #[ sampled %--% 1:n ]
el <- get.edgelist(graph)[as.vector(es)+1]
reachabelGraph1 <- graph(el, vcount(graph), directed = TRUE)
I got he Error "Extra arguments in make_graph"
kindly, how can I fix this?
Dear,
kindly please how can i
- select random node from a graph (red via ncol) ? and
- how to update node weight ?
replying is highly appreciated
Thanks in advance
RAE
___
igraph-help mailing list
igraph-help@non
ewweight
Gabor
On Sat, Jan 18, 2014 at 11:35 AM, Ragia Ibrahim wrote:
Dear,
kindly please how can i
- select random node from a graph (red via ncol) ? and
- how to update node weight ?
replying is highly appreciate
Hi,
what is the best way to plot large graph via igraph, please i need a tutorial
and away to change node& vertices's colors according to weight.
thanks in advance
RAE
___
igraph-help mailing list
igraph-help@
large graph
Hi, I am not sure what your question is exactly. (How to calculate the layout?
How to simplify the graph for plotting? How to set plotting parameters?)
Anyway, perhaps see http://igraph.sourceforge.net/doc/R/plot.common.html
Gabor
On Tue, Jan 21, 2014 at 6:13 AM, Ragia Ibrahim
hi
looking for influence Independent Cascade model coding
thanks in advance
RAE
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/list
Hi,
how to generate this via igraph
"Small-World Network: Begin with 5242 nodes arranged as a ring, and each node
is connected to its two direct neighbors Next, each node to the neighbors of
its neighbors
Then , randomly select 4012 pairs of nodes not yet connected and add an edge
between
2014 at 4:11 PM, Ragia Ibrahim wrote:
Hi,
how to generate this via igraph
"Small-World Network: Begin with 5242 nodes arranged as a ring, and each node
is connected to its two direct neighbors Next, each node to the neighbors of
its neighbors
Then ,
randomly select 4012 pa
Hi,
how to read and RDA file format in R...determine number of nodes, edges...etc
Thanks in advance
RAE
___
igraph-help mailing lis
lots of thanks
> Date: Sat, 25 Jan 2014 12:51:40 +0100
> From: nta...@gmail.com
> To: igraph-help@nongnu.org
> Subject: Re: [igraph] Small-World Network
>
> > thanks for replying
> > is this true for the first graph
> > watts.strogatz.game(5242 ,5242 ,2,0) ?
>
> No. Use graph.ring to generate
many thanks Gábor
Ragia
Date: Sat, 25 Jan 2014 23:20:26 -0500
From: csardi.ga...@gmail.com
To: igraph-help@nongnu.org
Subject: Re: [igraph] Small-World Network
On Sat, Jan 25, 2014 at 6:51 AM, Tamás Nepusz wrote:
> thanks for replying
> is this true for the first
Hi,
kindly please :
I had a graph, i can assign weight for each edge, but can i assign other
properties such as bool variable or other second weight.
Also how can i write " each v belongs to set of V's " where V is nodes.
or should i write it in for statement : for i in 1: lenght of v do
repl
very informative THANKS Gabor
Date: Wed, 29 Jan 2014 11:22:36 -0500
From: csardi.ga...@gmail.com
To: igraph-help@nongnu.org
Subject: Re: [igraph] Weight & bool variable
On Wed, Jan 29, 2014 at 11:18 AM, Ragia Ibrahim wrote:
Hi,
kindly please :
I had a graph, i can assign weight for
Hi ,
need your advice: what c++ program to use ?
thanks in advance
RAE
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
Dear members,
I got a graph
data<-(c(0,1, 0,8, 0,9, 0,2, 1,3, 2,3, 4,5, 5,1, 6,2, 7,6))
g1 <- graph( data+1 , directed=TRUE )
and i got all shortest paths
paths<-get.all.shortest.paths( g1, 1, 4 )
the paths contain:
[[1]]
[1] 1 3 4
[[2]]
[1] 1 2 4
HOW CAN I plot them like a graph, nodes e
Many thanks Gabor
Date: Thu, 30 Jan 2014 09:50:01 -0500
From: csardi.ga...@gmail.com
To: igraph-help@nongnu.org
Subject: Re: [igraph] igraph & C++
On Thu, Jan 30, 2014 at 9:39 AM, Tamás Nepusz wrote:
> need your advice: what c++ program to use ?
For what? :)
C++ compiler maybe? If yes, whi
Hi,
kindly please if I had a graph and want to get neighbours of node e.g, 3
i use this
V(graph) [ nei(3) ]
but how to get edges connected from, to, all
how can i get this?
thanks in advance
RAE
___
igraph-help
for() line.
Gabor
On Thu, Jan 30, 2014 at 6:49 AM, Ragia Ibrahim wrote:
Dear members,
I got a graph
data<-(c(0,1, 0,8, 0,9, 0,2, 1,3, 2,3, 4,5, 5,1, 6,2, 7,6))
g1 <- graph( data+1 , directed=TRUE )
and i got all shortest paths
paths<-get.all.shortest.paths( g1, 1, 4 )
the pat
Hi
I tried to run igraph sample prog,,,and it failed, here what i did
i install the package for Visual studio
took the uncompressed folder named igraph-6.5-msvc and took a copy from the
include files (include/igraph), into VC include folder
I did what is written here
http://www.programmingrelie
nongnu.org
Subject: Re: [igraph] Visual C++
You don't need to copy anything anywhere. Here are the steps to compile igraph
in Visual
Studio:http://stackoverflow.com/questions/12737397/various-issues-installing-igraph-in-visual-studio-2010-and-cygwin-mingw-sys-ti
Gabor
On Thu, Feb 6, 2014 at
l C++
You don't need to copy anything anywhere. Here are the steps to compile igraph
in Visual
Studio:http://stackoverflow.com/questions/12737397/various-issues-installing-igraph-in-visual-studio-2010-and-cygwin-mingw-sys-ti
Gabor
On Thu, Feb 6, 2014 at 7:15 AM, Ragia Ibrahim wrote:
Hi,
working with R, (found it better than c++, except debugging issue, maybe cause
I am new to it)
the problem now is adding time stamps to the graph, in each time interval
specific nodes active
how can I add this time stamp
say at time 0 nodes 1, 2 active
at time 1 nodes 1,2,5,7 active
any i
h-and-r-with-20-lines-of-code/
Gabor
On Sat, Feb 8, 2014 at 7:58 AM, Ragia Ibrahim wrote:
Hi,
working with R, (found it better than c++, except debugging issue, maybe cause
I am new to it)
the problem now is adding time stamps to the graph, in each time interval
specific nodes active
find plenty of examples. E.g.
http://estebanmoro.org/2012/11/temporal-networks-with-igraph-and-r-with-20-lines-of-code/
Gabor
On Sat, Feb 8, 2014 at 7:58 AM, Ragia Ibrahim wrote:
Hi,
working with R, (found it better than c++, except debugging issue, maybe cause
I am new to it)
the
find plenty of examples. E.g.
http://estebanmoro.org/2012/11/temporal-networks-with-igraph-and-r-with-20-lines-of-code/
Gabor
On Sat, Feb 8, 2014 at 7:58 AM, Ragia Ibrahim wrote:
Hi,
working with R, (found it better than c++, except debugging issue, maybe cause
I am new to it)
the
Hi,
how to create clusters(graph) that contain specific node?
or shall i just create all possible clusters and check it it has this node? if
this is the case how to check?
thanks in advance
RAE
___
igraph-help ma
node
>
> Hi,
>
> Take a look at ?subcomponent.
>
> --
> T.
>
>
> On Tuesday, 18 February 2014 at 20:22, Ragia Ibrahim wrote:
>
> > Hi,
> > how to create clusters(graph) that contain specific node?
> > or shall i just create all possible clust
take their intersection. This is
the strongly connected component of your vertex.
If you want to do this for all vertices, then it is better to simply calculate
all strongly connected components with clusters().
G.
On Tue, Feb 18, 2014 at 5:20 PM, Ragia Ibrahim wrote:
thanks T, that was
?
should i pass copy of the graph each time i write a function ?
how should the program looks like?
thanks in advance
Ragia
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman
section 10, "Writing your own
functions".
http://cran.r-project.org/doc/manuals/r-release/R-intro.html#Writing-your-own-functions
Gabor
On Tue, Feb 18, 2014 at 6:56 PM, Ragia Ibrahim wrote:
Hi,
I used to write C++ code. write what i want in a function ..pass pointers if i
want
might help
http://www.cs.rutgers.edu/~mlittman/courses/cs105-06b/lectures/10graphs.pdf
RAE
> Date: Fri, 21 Feb 2014 09:05:29 +0100
> From: nta...@gmail.com
> To: ahmed.elma...@gmail.com; igraph-help@nongnu.org
> Subject: Re: [igraph] BFS of a certain number of steps
>
> It takes <10 li
hi,
trying to traverse the graph, kindly whats wrong in this..why its infinite
loop..
graph_dfs<-function(i) #i is id
{
if(V(graph)$reached[i] == FALSE)
{ # print(str(i)); print("is reachable")
str(i); print("is reachable")
V(graph)$reached[i]<-TRUE
node_
Dear Group
is Tarjan's strongly connected components, implemented in igraph ?
Thanks in advance
RAE
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
m
> To: igraph-help@nongnu.org
> Subject: Re: [igraph] SCC Tarjan's
>
> How about using clusters() with mode=“strong”? Not sure if it’s Tarjan’s
> algorithm or some other implementation, but it does the job.
>
> --
> T.
>
> ----
r/doc/clusters.html
mode
Character string, either “weak” or “strong”. For directed graphs “weak” implies
weakly, “strong” strongly connected components to search. It is ignored for
undirected graphs.
Gabor
On Mon, Mar 17, 2014 at 12:36 PM, Ragia Ibrahim wrote:
thanks T,
the graph is as fo
Hi,
kindly please if i had set of edges "E(graph)", how can I delete and edge, add
an edge and empty it.
thanks in advance
Ragia
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.
Dear group,
kindly how can i collapse edges on the wight sum over node degree, for each
redundant relation between two nodes.
example if i have relation between
node1 and node 2 weight 1
node 1 and node 2 (again) weight 1
node 2 and node1
Dear group,
kindly how can i get vertex ids based on edge sequence thanks in advanceRAE
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
le to sort..and get intersection and union between
reachable lists..
any suggestions please
Ragia.
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
kindly, can I have list of reachable nodes for each node in V(graph) ?
I can not add it as an attribute to each node...I need to keep this list of
reachable ones thus i can intersect and union them later on.
replying is highly appreciated
Ragia
Date: Sat, 10 May 2014 18:40:55 -0400
From
kindly please
in R,
if i have such the coming warning ...how should I deal with ?
Warning messages:
1: In vattrs[[name]][index] <- value :
number of items to replace is not a multiple of replacement length
many thanks
Ra
its number e.g 3
Regards
Ragia
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
Hello,
I have two files one is NXN matrix represents nodes relations, and the second
file contains node id and the node name and age as an attribute.
my question is:
what kind of file type can I use to hold all of this to one file then convert
it into graph in igraph.
many thanks
Ragia
Hi,
how can I plot degree distribution in igraph? can I examine if its fit to power
low or not? if yes, how?
thanks in advance.
Ragia
___
igraph-help mailing list
igraph-help@nongnu.org
https
Hi,
no.clusters(G) gets the clusters of the graph and from it I can get the max
cluster. but Can I get what nodes involves in that cluster? what are there Id's
.attributes.
many thanks
Ragia
___
igraph
Hi,
how can I save a graph as into a file to visualise via Gephi
thanks in advance
Ragia
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
gt;
> Gabor
>
> On Sat, Oct 11, 2014 at 3:23 PM, Ragia Ibrahim wrote:
> >
> > Hi,
> > how can I save a graph as into a file to visualise via Gephi
> > thanks in advance
> > Ragia
> >
> > ___
> >
kindly, cna I calculate standard diviation for node degree?
thanks in advance
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
Hi,
kindly, how can I check if a specific node is between two different clusters?
thanks in advance
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
thanks G., I found it, I will check its betweeness againest the highest
betweenes.
Ragia
> Date: Mon, 13 Oct 2014 15:36:40 -0400
> From: csardi.ga...@gmail.com
> To: igraph-help@nongnu.org
> Subject: Re: [igraph] between different clusters
>
> Hi, what does it mean to be bet
kindly, I needed to know the percent of each community in a graph via
[fastgreedy.community], as well as percent of largest three ones ?
how can I do this?
Best Regards,
Ragia
___
igraph-help mailing
Hello,
kindly how can get shortest path form node v to all other nodes on the graph on
condition depends on edge weight, for example get the path were edge weight is
grater than .4
thanks in advance
Ragia
gnu.org
Date: Sat, 1 Nov 2014 08:40:36 +0200
Subject: [igraph] shortest path on condition
Hello,
kindly how can get shortest path form node v to all other nodes on the graph on
condition depends on edge weight, for example get the path were edge weight is
grater
...@gmail.com
> To: igraph-help@nongnu.org
> Subject: Re: [igraph] shortest path on condition
>
> Delete all the edges that have an edge weight smaller than 0.4 and then run
> a standard shortest path algorithm.
>
> T.
>
> On 11/01, Ragia Ibrahim wrote:
> > Hello,
> &
many thanks, I was not looking to suppress the warning. I wanted to know if I
had problem to fix thus no warnings appear.
Ragia
> Date: Sat, 1 Nov 2014 21:20:57 +0100
> From: nta...@gmail.com
> To: igraph-help@nongnu.org
> Subject: Re: [igraph] shortest path on condition
>
>
Hello,
kindly if I spliet the graph through "
fc<-fastgreedy.community(as.undirected(g)) " into communties, how to determine
links (edges) between those communities. If i had 100 community and a link for
example between community 1 and 6 ho to get this link id or the nodes that are
connect
Hello,
kindly, I want to generate random 'n' numbers for a node connected in- edges.
but under the constrain that total number of edges weight could not be more
than one <=1.
thanks in advance
Ragia
_
By "Total number", I meant sum of edges (edges connected to the same node)
weight should be less than 1 in the same time each edge should have weight from
0 to 1.
Pardon me if I miss the meaning of the world.
> Date: Sat, 22 Nov 2014 17:18:48 +0100
> From: nta...@gmail.com
> To: igraph-help@no
(hit accidentally before revising).
the meaning of the word
Ragia
From: ragi...@hotmail.com
To: igraph-help@nongnu.org
Date: Sat, 22 Nov 2014 22:04:11 +0200
Subject: Re: [igraph] generate random weights for edges under constrain
By "Total number", I meant sum of edges (edges co
kindly, do you know any
cloud service could be used (preferred free one)
I am looking for a cloud to put my igraph (written with R) script and try it,
my Pc is very slow.many thanks
Ragia
___
igraph-help
est.paths(G,6,3)$vpath[[1]])$prob)
this do not give me the vertices in between, how can I get them? and can I
multiply probabilities instead of adding ?
your reply is highly appreciated
thanks in advance
Ragia
_
Brilliant .
lots of thanks
> Date: Sun, 4 Jan 2015 21:19:51 +0100
> From: nta...@gmail.com
> To: igraph-help@nongnu.org
> Subject: Re: [igraph] Shortest path with highest weights
>
> > Dear group,
> > kindly I have a graph that got the following edges:
> > 6 -> 4 with prob 0.4
> > 4 -> 3 with p
Hi,
firstly accept my pardon for the long Email, but I wanted to clarify my issue.
a graph crated via fire forest model. the problem is as follows:
the following edges in the graph regarding node 18
18 -> 12
[35] 18 -> 8
[36] 18 -> 5
[37] 18 -> 4
[38] 18 -> 14
[39] 18 -> 15
[40] 18 ->
many thanks
R.I
Date: Wed, 21 Jan 2015 09:13:54 -0500
From: csardi.ga...@gmail.com
To: igraph-help@nongnu.org
Subject: Re: [igraph] delete.vertices
On Wed, Jan 21, 2015 at 2:37 AM, Tamas Nepusz wrote:
Hi,
Vertex indices in igraph are always in the range [0; |V|-1] where |V| is the
Small fix
ue in $res is it the place of node in vertex sequence?
thanks in advance
Ragia
___
igraph-help mailing list
igraph-help@nongnu.org
https://lists.nongnu.org/mailman/listinfo/igraph-help
72 matches
Mail list logo
