You can subscribe to this list here.
2003 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
(9) |
Sep
(14) |
Oct
(19) |
Nov
(38) |
Dec
(77) |
---|---|---|---|---|---|---|---|---|---|---|---|---|
2004 |
Jan
(31) |
Feb
(59) |
Mar
(56) |
Apr
(35) |
May
(79) |
Jun
(90) |
Jul
(50) |
Aug
(141) |
Sep
(56) |
Oct
(132) |
Nov
(78) |
Dec
(158) |
2005 |
Jan
(90) |
Feb
(71) |
Mar
(77) |
Apr
(159) |
May
(183) |
Jun
(127) |
Jul
(253) |
Aug
(104) |
Sep
(110) |
Oct
(207) |
Nov
(149) |
Dec
(102) |
2006 |
Jan
(92) |
Feb
(165) |
Mar
(214) |
Apr
(227) |
May
(130) |
Jun
(139) |
Jul
(74) |
Aug
(110) |
Sep
(136) |
Oct
(114) |
Nov
(112) |
Dec
(131) |
2007 |
Jan
(135) |
Feb
(212) |
Mar
(302) |
Apr
(239) |
May
(210) |
Jun
(163) |
Jul
(181) |
Aug
(288) |
Sep
(134) |
Oct
(228) |
Nov
(177) |
Dec
(106) |
2008 |
Jan
(113) |
Feb
(199) |
Mar
(131) |
Apr
(215) |
May
(105) |
Jun
(119) |
Jul
(140) |
Aug
(126) |
Sep
(139) |
Oct
(157) |
Nov
(105) |
Dec
(103) |
2009 |
Jan
(185) |
Feb
(181) |
Mar
(201) |
Apr
(221) |
May
(175) |
Jun
(172) |
Jul
(153) |
Aug
(108) |
Sep
(87) |
Oct
(24) |
Nov
(21) |
Dec
(27) |
2010 |
Jan
(10) |
Feb
(52) |
Mar
(75) |
Apr
(128) |
May
(150) |
Jun
(110) |
Jul
(71) |
Aug
(75) |
Sep
(65) |
Oct
(88) |
Nov
(95) |
Dec
(55) |
2011 |
Jan
(35) |
Feb
(54) |
Mar
(67) |
Apr
(75) |
May
(49) |
Jun
(57) |
Jul
(36) |
Aug
(30) |
Sep
(42) |
Oct
(10) |
Nov
(28) |
Dec
(39) |
2012 |
Jan
(70) |
Feb
(20) |
Mar
(32) |
Apr
(65) |
May
(29) |
Jun
(11) |
Jul
(13) |
Aug
(23) |
Sep
(22) |
Oct
(9) |
Nov
(13) |
Dec
(10) |
2013 |
Jan
(9) |
Feb
(9) |
Mar
(9) |
Apr
(7) |
May
(7) |
Jun
(2) |
Jul
(10) |
Aug
(2) |
Sep
(6) |
Oct
(5) |
Nov
(8) |
Dec
(3) |
2014 |
Jan
(17) |
Feb
(8) |
Mar
|
Apr
(3) |
May
|
Jun
(6) |
Jul
(6) |
Aug
|
Sep
(1) |
Oct
(2) |
Nov
(3) |
Dec
(2) |
2015 |
Jan
(1) |
Feb
(2) |
Mar
(1) |
Apr
(4) |
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2017 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
(1) |
From: SourceForge.net <no...@so...> - 2013-01-07 20:27:28
|
The following forum message was posted by marie87 at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6567581: ok, thank you. |
From: SourceForge.net <no...@so...> - 2013-01-07 18:25:19
|
The following forum message was posted by e-flat at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6567581: You'll need to implement this yourself, or find an existing implementation elsewhere; JUNG does not provide a graph factory for this kind of specification. Note that not all such specifications are valid. |
From: SourceForge.net <no...@so...> - 2013-01-07 10:57:41
|
The following forum message was posted by marie87 at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6567581: Hello, I want to create a graph with specified degrees, for example : 5 vertices with degree = 1 & 4 vertices with degree = 2 & 3 vertices with degree = 3. How can I do that ? I want the equivalent of configuration_model() of python. could anyone help me ? Thank you. |
From: SourceForge.net <no...@so...> - 2013-01-05 21:34:24
|
The following forum message was posted by nenoxl at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6561721: yeah I know that about the circle layout, but is there a way to paint the edges in such way that it looks like a circle again? I need to have the vertices to be spaced unevenly, but it still should look like a circle. is there no way to change the arc angle for every edge? |
From: SourceForge.net <no...@so...> - 2013-01-05 21:04:36
|
The following forum message was posted by e-flat at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6561721: The reason it's called "CircleLayout" is because the _vertices_ are placed (evenly) on a circle, not because of anything about the edges. You can render the edges however you like, but if you want the eye to interpret it as a circle most readily, just space the vertices evenly. Joshua |
From: SourceForge.net <no...@so...> - 2013-01-05 19:51:32
|
The following forum message was posted by nenoxl at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6561721: hi there, I'm using a CircleLayout for my graph. I overrid the initiate() method so that the vertices are drawn on a certain position in the circle depending on its id. This means that vertices are spread irregular on the circle. Now i have a problem, because of how the edges are rendered, the graph doesnt look like a cricle anymore. [img]http://img560.imageshack.us/img560/9763/circlef.jpg[/img] is there a way to make the the edges look like a circle again? thanks for your help |
From: SourceForge.net <no...@so...> - 2012-12-28 04:36:39
|
The following forum message was posted by e-flat at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6510198: As I said above, I responded on StackOverflow (and have just done so again). Let's keep the discussion in one place, i.e., not here. :) I will summarize my response there by saying that you still haven't defined your risk model and thus there is no way to define an algorithm and no way to help you. If you've got a paper on which your unspecified model is based, you should at least link it. Joshua |
From: SourceForge.net <no...@so...> - 2012-12-26 13:21:12
|
The following forum message was posted by at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6510198: Joshua - I stated my question at http://stackoverflow.com/questions/13982323/how-to-assign-weight-to-a-node-in-a- directed-network-graph-and-caculate-the-effe Just for ease, here it is... (1) Say I have a graph with many nodes of predetermined risk for each node. (2) Now some of these nodes are connected to others with directional edges. These edges have variable thickness. i.e. Depending on the size of the edge, the resultant risk would vary. (3) Now I would like to calculate the effective risk of these nodes based on the connectivity. I have seen JUNG scoring packages. I am not sure which algorithm that I need to use based on my requirement. Can you please suggest which would be more appropriate & is there a sample implementation? |
From: SourceForge.net <no...@so...> - 2012-12-22 16:46:30
|
The following forum message was posted by e-flat at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6510198: Answered (to the extent currently possible) on your StackOverflow question: http://stackoverflow.com/questions/13982323/how-to-assign-weight-to-a-node-in-a- directed-network-graph-and-caculate-the-effe (You're not really providing enough information about your requirements; I suggest you revise the question.) Joshua |
From: SourceForge.net <no...@so...> - 2012-12-21 13:17:08
|
The following forum message was posted by at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6510198: How to assign weight to a node in a directed network graph and calculate the effective node weight? [b]My Problem:[/b] I have a set of nodes, with some nodes are connected by directional edges. I want to assign the weights to each node and each edge. Finally I would like to calculate effective node weights based on influence of the connected nodes. [b]Background:[/b] Currently I am using JUNG to solve my problem. I looked at JUNG package edu.uci.ics.jung.algorithms.scoring. But not sure if they would help me achieve my objectives. Any help would be appreciated. Thanks, Ramesh |
From: SourceForge.net <no...@so...> - 2012-12-19 18:23:32
|
The following forum message was posted by e-flat at http://sourceforge.net/projects/jung/forums/forum/252062/topic/1166743: I'm sorry to hear that you still have to work with 1.7.6. Please note that we no longer support it. If you have any choice about upgrading, I recommend that you do so. Many things will be easier and faster. Otherwise: there are samples in the 1.7.6 distribution files. Joshua |
From: SourceForge.net <no...@so...> - 2012-12-19 11:42:14
|
The following forum message was posted by jungnoob176 at http://sourceforge.net/projects/jung/forums/forum/252062/topic/1166743: Hi, i am new at Jung. I am working on a project that uses jung 1.7.6 and I am looking for some examples of the old jung. Could anyone help me finding some code examples, so I can compilate them and try. Many thanks |
From: SourceForge.net <no...@so...> - 2012-12-06 09:02:09
|
The following forum message was posted by kpreetiaiyer at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6381389: Thank you for the quick response. As a matter of fact, I did use FRLayout and SpringLayout. Since, the vertices in the graph do not have many connections, these do not seem to work. I also tried to change the location of vertices if their shapes intersected during visualization, but the result was still not satisfactory. Any other way to deal with this problem? Thank you once again. Preeti |
From: SourceForge.net <no...@so...> - 2012-12-05 18:20:11
|
The following forum message was posted by e-flat at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6381389: The reason why they don't show up as overlapping when you zoom in is presumably because you're using the zoom mode in which the vertices don't continue to get larger as you zoom in past a certain point. Whether the vertices overlap is a function of how many vertices you are laying out and what layout algorithm you're using. Have you tried any of the other algorithms? Joshua |
From: SourceForge.net <no...@so...> - 2012-12-05 15:15:12
|
The following forum message was posted by kpreetiaiyer at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6381389: Hello everyone, I have a large graph with disjoint components. I am using aggregate layout with ISOM layout for individual components. All the vertices have different x, y coordinates. However, when I try to visualize them, they tend to overlap. On zooming, I notice that initially overlapping vertices are actually far apart. Is there a way how one can avoid overlap in the initial view itself. I searched the forum for a solution without any success. Any help would be greatly appreciated. Thanks in advance, Preeti |
From: SourceForge.net <no...@so...> - 2012-12-04 21:53:48
|
The following forum message was posted by yzhang14 at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6373161: My program crashed when calling the getVertexScore() function of ClosenessCentrality. A null pointer exception is reported. Please see both below. I can run BetweennessCentrality, PageRank without any problem. I found a thread on this in the forum that was posted several years ago. It seems there is a solution, but the instruction wasn't complete. Any help will be appreciated! ClosenessCentrality closenessScorer = new ClosenessCentrality(socialNetworkJung); for (User user : socialNetworkJung.getVertices()) { closenessMap.put(user, closenessScorer.getVertexScore(user)); java.lang.NullPointerException at edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer.getVertexScore( DistanceCentralityScorer.java:194) Yifeng Zhang Univ. of Illinois at Springfield |
From: SourceForge.net <no...@so...> - 2012-11-28 16:48:02
|
The following forum message was posted by pgrosso66 at http://sourceforge.net/projects/jung/forums/forum/252062/topic/5665381: Ya, I think you are in the wrong place Leor Zahavi . Try going to their website for more direction. http://www.java.com/en/about/ ya never know, it might be more helpful. |
From: SourceForge.net <no...@so...> - 2012-11-21 12:55:37
|
The following forum message was posted by balasubr at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6236593: Hello - I would appreciate for your help in this 1) Is it possible to display un connected (no edges) Nodes with my own calculation of size (Weight/Voltage)? 2) In a typical JUNG display, can I display the size of the Nodes on my calculation rather than using Voltage? 3) Regarding the "Vertex Voltage Size" in http://jung.sourceforge.net/applet/pluggablerendererdemo.html, what is the algorithm is being used? Can you give some reference for further reading on this? Thanks, Ramesh |
From: SourceForge.net <no...@so...> - 2012-11-20 21:51:09
|
The following forum message was posted by allanzc at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6199818: Thanks! Joshua, I just thought that the the elements of file1 will still remain in g if I dont do any thing before next loop, I am a new hand on java, sorry for the naive question, but I really appreciate your patient answer! |
From: SourceForge.net <no...@so...> - 2012-11-20 21:39:21
|
The following forum message was posted by e-flat at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6199818: Just do this: for (File file: files) { Graph g = createGraphFromFile(file); // do stuff with g; } That's it. Let Java do the garbage collection after the loop is complete. You don't need to do anything else. FYI, this is not really a JUNG-specific question; this is a question about how to handle resources in Java. You may want to look around the web for more general Java tutorials; the Java site's tutorial at least used to be pretty good. Joshua |
From: SourceForge.net <no...@so...> - 2012-11-20 21:34:38
|
The following forum message was posted by allanzc at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6199818: hi, sorry if I did not made it clear, my purpose is that I want to apply a same analyzing method in 10 different networks, and want a quick way to do that. I thought when I only use one network, e.g. if I create a network g for file1, add all edges and nodes from file1. After finishing the analyzing in one loop, then next for file2, should I remove all the edges and nodes in g first, and read file2 to add edges and nodes in file2 for g? My question is like, how to destroy a network or remove all the elements quickly in one graph if I dont need it anymore? Thanks! |
From: SourceForge.net <no...@so...> - 2012-11-20 20:07:55
|
The following forum message was posted by e-flat at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6199818: I don't know what problem that you're having with creating multiple instances of UndirectedSparseGraph; it's just a container class like anything in the Collections framework. Please post more information about the problem you're having. If you only need one graph at a time--your question makes this unclear--then there's no reason to create more than one; just create the reference inside the loop where you're reading the graph, and let Java deal with the garbage collection. |
From: SourceForge.net <no...@so...> - 2012-11-19 06:56:12
|
The following forum message was posted by allanzc at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6199818: Hello, This may be a naive question, but I don't how to deal with my problem. I want to create several networks at one time. Say there are 10 files representing 10 networks, and now I would like to create these 10 networks at a time, I thought a loop may solve this, where in each round of the loop it creates one network and performs the related analysis. However, it seems I can not define multiple graphs with the "UndirectedSparseGraph<MyNode, MyLink>" structure, is there any way that I can do to solve it? Another way I think may work is that I only define one graph, then I can remove all the edges and nodes of one graph at the end of each loop, and add nodes/edges for another graph at the begining of the next loop, but is there any efficient way to clear a graph? Thanks! |
From: SourceForge.net <no...@so...> - 2012-11-13 09:11:33
|
The following forum message was posted by kpreetiaiyer at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6163379: Hi Joshua and Tom, Thank you both for the suggestions. I tried the first option and it is working. Appreciate the help..! Preeti |
From: SourceForge.net <no...@so...> - 2012-11-13 09:10:54
|
The following forum message was posted by kpreetiaiyer at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6163379: Hi Joshua and Tom, Thank you both for the suggestions. I tried the first option and it is working. Appreciate the help..! Preeti |