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-04-27 16:19:33
|
The following forum message was posted by e-flat at http://sourceforge.net/projects/jung/forums/forum/252062/topic/7951829: If you want the ZIP file from SourceForge, you want jung2-2_0_1-sources.zip. https://sourceforge.net/projects/jung/files/jung/jung-2.0.1/ Joshua |
From: SourceForge.net <no...@so...> - 2013-04-27 13:53:39
|
The following forum message was posted by brothergarry at http://sourceforge.net/projects/jung/forums/forum/252062/topic/7951829: I'm answering myself; source code is available here: svn checkout http://jung.googlecode.com/svn/trunk/ jung-read-only |
From: SourceForge.net <no...@so...> - 2013-04-26 14:43:58
|
The following forum message was posted by brothergarry at http://sourceforge.net/projects/jung/forums/forum/252062/topic/7951829: I may be looking right at it, but where is the source code for the examples? The source for JUNG itself? It doesn't seem to be in the jung2-2_0_1.zip download. If it is in the archive, where exactly can I find it? Thanks, Garry |
From: DreamFlasher <dre...@ya...> - 2013-04-17 09:23:29
|
Hi, I am using jung 2.01 (via maven central) and get the following exception: Exception in thread "main" java.lang.NoSuchMethodError: edu.uci.ics.jung.graph.AbstractGraph.getDefaultEdgeType()Ledu/uci/ics/jung/graph/uti l/EdgeType; at edu.uci.ics.jung.graph.AbstractGraph.addEdge(AbstractGraph.java:55) when invoking graph.addEdge(E e, V v1, V v2); I could add EdgeType.DIRECTED but then I get: Exception in thread "main" java.lang.NoSuchMethodError: edu.uci.ics.jung.graph.AbstractGraph.containsEdge(Ljava/lang/Object;)Z at edu.uci.ics.jung.graph.AbstractGraph.getValidatedEndpoints(AbstractGraph.java:89) at edu.uci.ics.jung.graph.DirectedSparseGraph.addEdge(DirectedSparseGraph.java:64) at edu.uci.ics.jung.graph.AbstractGraph.addEdge(AbstractGraph.java:60) Do you have any ideas what is going wrong? Thank you, Marcel |
From: SourceForge.net <no...@so...> - 2013-04-15 12:50:32
|
The following forum message was posted by lmartel at http://sourceforge.net/projects/jung/forums/forum/252062/topic/7549674: Hello, I didn't find the way to precise the attr.type of a key with GraphMLWriter. With GraphML, a key declaration is supposed to be someting like : [code] <key id="d0" for="node" attr.name="color" attr.type="string"> <default>yellow</default> </key> [/code] but what I managed to get with GraphMLWriter is : [code] <key id="d0" for="node"> <default>yellow</default> </key> [/code] I don't care about attr.name but attr.type may be necessary to parse the output GraphML file. Any idea about how I should do to get tyis attr.type stuff ? Thank you very much Léo |
From: SourceForge.net <no...@so...> - 2013-04-04 08:39:14
|
The following forum message was posted by at http://sourceforge.net/projects/jung/forums/forum/252062/topic/7325542: I want to control the size of the edges that are reflexive (pointing to the same vertex as it comes from). They seem to be very small. |
From: SourceForge.net <no...@so...> - 2013-03-27 15:09:28
|
The following forum message was posted by igorkvasnicka at http://sourceforge.net/projects/jung/forums/forum/252062/topic/7217715: sorry, my mistake - it works with no problem |
From: SourceForge.net <no...@so...> - 2013-03-27 14:59:55
|
The following forum message was posted by igorkvasnicka at http://sourceforge.net/projects/jung/forums/forum/252062/topic/7217715: Hi is it possible to update/change vertex's label? I don't want to change transformer, I just want the label itself to update my code looks like this: [code] vv.getRenderContext().setVertexLabelTransformer(new Transformer<MyVertex, String>() { @Override public String transform(MyVertex v) { return v.getName(); } });[/code] thanks a lot |
From: SourceForge.net <no...@so...> - 2013-03-22 20:35:38
|
The following forum message was posted by st15808 at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6666796: I have the same problem. Solution is make it own menu handler or editing source of EditingModalGraphMouse.class and send patch to developers. |
From: SourceForge.net <no...@so...> - 2013-03-21 20:51:05
|
The following forum message was posted by oisin123 at http://sourceforge.net/projects/jung/forums/forum/252062/topic/7115296: I have a static layout dicated by a vertex's x and y attributes. Depending on the graph, the attributes may range from (0, 1000) or (-5, 2.3). Is there a way to automatically scale my graph to fit it on screen? If yes, does this also apply to the satellite viewer? |
From: SourceForge.net <no...@so...> - 2013-03-12 20:27:35
|
The following forum message was posted by e-flat at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6891683: No. You should be able to implement it yourself using the existing graph generators as a guide, however. Joshua |
From: SourceForge.net <no...@so...> - 2013-03-06 10:53:48
|
The following forum message was posted by at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6891683: Is there any implementaion that generates girvan newman graphs? I would like to use it as a benchmark. Thanks Sotiris |
From: SourceForge.net <no...@so...> - 2013-03-02 15:50:57
|
The following forum message was posted by zuzufrommars at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6877621: Hello Everyone First of all, well done, this lib is really great ! I discovered this lib this week, and my first project works, I am modelize simple flight reservation. As edge I have created an Flight Class As vertex I have created an Airport Class I have put duration for each flight and succeed to associated dijsktra algorithm (DijkstraShortestPath) [code] class Airport { String name; ….. } class Flight { String flight; int duration; } g = new DirectedSparseMultigraph<Airport, Flight>(); Flight AXXX = new Flight("A57",3); Flight AYYY = new Flight("A53",1); …. ORY = new Airport("ORY"); LYS = new Airport("LYS"); …. g.addEdge(AXXX, ORY, LYS); g.addEdge(AYYY, LYS, ORY); …… Transformer<Flight, Integer> wtTransformer = new Transformer<Flight, Integer>() { @Override public Integer transform(Flight link) { return link.duration; } }; DijkstraShortestPath<Airport, Flight> alg = new DijkstraShortestPath(g, wtTransformer); Number dist = alg.getDistance(LAI, MRS); ….. [/code] This simple case works well, but now I would to calculate duration as: Flight1 start 12/01/13 at 12:00 and arrival at 13/01/13 at 14h Flight2 start 13/01/13 at 18:00 and arrival at 13/01/13 at 20h In this case I want to calculate durate from flight AND between flight. Cause to get shortest path from one to another flight we need to take care about time to way between flight and not only flight duration. But DiskstraShortestPath allow only Transformer as: Transformer<Object, Integer> so I can’t get reference to previous flight to calculate total duration (wait + flight). So my question is: what is the best way for my case ? Create new algorithm (inherit DijsktraShortestPath…) Create new GraphType (inherit DirectedSparseMultigraph…) Thanks for you answer guy ;) ! |
From: Liu, H. <HAIBIN.LIU@UCDENVER.EDU> - 2013-02-22 16:31:25
|
Try -Xmx4G if you have >4G RAM Haibin ________________________________________ From: Amal Zouaq [ama...@gm...] Sent: Friday, February 22, 2013 9:24 AM To: jun...@li... Subject: [Jung-support] Fwd: DijkstraShortestPath-OutOfMemory Good day, I am getting an OutOfMemory Exception while using JUNG's DijkstraShortestPath on a big graph (~ 7000 nodes, 9000 edges). The exception is the following: Exception in thread "Thread-865725" java.lang.OutOfMemoryError: GC overhead limit exceeded at java.util.HashMap.addEntry(Unknown Source) at java.util.HashMap.put(Unknown Source) at java.util.HashSet.add(Unknown Source) at edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.getDistance(DijkstraDistance.java:265) My JAVA program is started with -Xmx1500m. Any idea what can be done? -- Dr. Amal Zouaq Professeure adjointe | Assistant Professor Département de mathématiques et d'informatique| Department of Mathematics and Computer Science Collège militaire royal du Canada | Royal Military College of Canada CP 17000, Succursale Forces, Kingston ON CANADA K7K 7B4 ama...@rm...<mailto:ama...@rm...> Office | Bureau Girouard 320 Telephone | Téléphone 613-541-6000 # 6478 Fax | Télécopieur 613-541-6584 http://azouaq.athabascau.ca/ |
From: Amal Z. <ama...@gm...> - 2013-02-22 16:24:52
|
Good day, I am getting an OutOfMemory Exception while using JUNG's DijkstraShortestPath on a big graph (~ 7000 nodes, 9000 edges). The exception is the following: Exception in thread "Thread-865725" java.lang.OutOfMemoryError: GC overhead limit exceeded at java.util.HashMap.addEntry(Unknown Source) at java.util.HashMap.put(Unknown Source) at java.util.HashSet.add(Unknown Source) at edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.getDistance(DijkstraDistance.java:265) My JAVA program is started with -Xmx1500m. Any idea what can be done? -- Dr. Amal Zouaq Professeure adjointe | Assistant Professor Département de mathématiques et d'informatique| Department of Mathematics and Computer Science Collège militaire royal du Canada | Royal Military College of Canada CP 17000, Succursale Forces, Kingston ON CANADA K7K 7B4 ama...@rm... Office | Bureau Girouard 320 Telephone | Téléphone 613-541-6000 # 6478 Fax | Télécopieur 613-541-6584 http://azouaq.athabascau.ca/ |
From: Luc H. <luc...@in...> - 2013-02-21 09:47:51
|
Hi, Because of this problem I developped a fast implementation of page rank in the Grph library. Feel free to have a try with it. Don't hesiste to contact me if needed. I'll be happy to help you. http://www-sop.inria.fr/members/Luc.Hogie/grph/ Best regards, Luc. On 2/21/13 10:44 AM, ga...@gm... wrote: > Hello all, > > I was trying out JUNG2 for calculating Pagerank for larger datasets, exactly for dbpedia-datasets. > > Well using Strings with larger datasets is of course not very smart, so a Integer representation is necessary. > > I use a DirectedSparseGraph<Integer, Integer> and the following amount of (almost Integer) data: > preferenceVector as HashMap<Integer, Double> containing 18*10^6 entries > edges: 130*10^6 > vertices: 18*10^6 > > Trying out calculation of pagerank with DirectedSparseGraph<Integer, Integer> leads to huge RAM consumption (graph.addEdge(Integer, Integer, Integer, EdgeType.DIRECTED)). > > Why is that this way? Is there an more efficient way? Any important archetectural background? I allocated 30GB RAM and its not possible to calculate Pagerank with the above amount of edges and vertices with simple Integer values. > > best regards > ------------------------------------------------------------------------------ > Everyone hates slow websites. So do we. > Make your web apps faster with AppDynamics > Download AppDynamics Lite for free today: > http://p.sf.net/sfu/appdyn_d2d_feb > _______________________________________________ > Jung-support mailing list > Jun...@li... > https://lists.sourceforge.net/lists/listinfo/jung-support -- Luc Hogie - CNRS Research Engineer COMRED Research Unit (I3S(CNRS-UNS) INRIA) http://www-sop.inria.fr/members/Luc.Hogie/ luc...@i3... +33 4 89 73 24 25 (office) +33 6 80 91 40 71 (mobile) Skype ID: luchogie |
From: <ga...@gm...> - 2013-02-21 09:45:01
|
Hello all, I was trying out JUNG2 for calculating Pagerank for larger datasets, exactly for dbpedia-datasets. Well using Strings with larger datasets is of course not very smart, so a Integer representation is necessary. I use a DirectedSparseGraph<Integer, Integer> and the following amount of (almost Integer) data: preferenceVector as HashMap<Integer, Double> containing 18*10^6 entries edges: 130*10^6 vertices: 18*10^6 Trying out calculation of pagerank with DirectedSparseGraph<Integer, Integer> leads to huge RAM consumption (graph.addEdge(Integer, Integer, Integer, EdgeType.DIRECTED)). Why is that this way? Is there an more efficient way? Any important archetectural background? I allocated 30GB RAM and its not possible to calculate Pagerank with the above amount of edges and vertices with simple Integer values. best regards |
From: LEVORATO V. <vle...@ce...> - 2013-02-18 00:16:59
|
Dear Jung staff, Here is the email I sent to Joshua O'Madadhain : I am a french computer sciences researcher working in a computer sciences school named exia.cesi, and associated with a french laboratory in Orléans city. I used the Jung library for several years (at least 6 or 7 years). As my research fields need to use graph theory and experiments, I'm still using Jung nowadays. As I felt a little loss of activity around its development, I would like to offer my services and join the development team to make it evolve. I worked a lot on graph algorithms, recently (and still) with exact and FPT methods in a research project which one of its goals was to implement algorithms. It led to the AGAPE library, which is an extension of jung for exact and FPT algorithms. And yes, I am programming with the JAVA language, indeed. You can have informations on my profile here: http://www.univ-orleans.fr/lifo/Members/Vincent.Levorato Yours sincerely, [Description : Description : C:\Users\vlevorato\Pictures\logo cesi IRISE.png] Vincent LEVORATO Chercheur en Informatique CESI-IRISE 959 rue de la Bergeresse 45160 Olivet Mobile : 07 62 46 18 10 Fixe : 02 38 22 72 89 http://www.cesi.fr/ |
From: SourceForge.net <no...@so...> - 2013-02-17 19:58:26
|
The following forum message was posted by nedsana at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6759828: Hi, for the last week I've been tying to implement the following task with JUNG library: [i]A graph should be created. Each vertex should be either JPanel(preferrably) or JFrame. These vertexes will contain random GUI items(buttons, textfields, dropdown menus, etc) and these should be fully functional.[/i] So far I succeded in creating the graph with the JPanels and JFrames as vertexes, but they are none functional. My investigation shows that the vertexes are out of Focus. I tried to execute functions like setFocusable(true); requestfocus(); and added a focus listener, but it showed that the focus is always on the Visualization Viewer instance. So my questions: 1. How can I set the focus on the GUI vertexes? 2. If focus is not the solution to my problem, what should I do make the vertex GUIs active? 3. A bit off-topic: currently my vertexes can be picked and moved only if they are selected at the upper left corner of the JPanel/JFrame. How can I make the whole area of the JPanel/JFrame pickable? Here is my code: [code]import java.awt.Color; import java.awt.Container; import java.awt.Dimension; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.awt.event.FocusEvent; import java.awt.event.FocusListener; import java.awt.event.ItemEvent; import java.awt.event.ItemListener; import java.awt.geom.Point2D; import javax.swing.BorderFactory; import javax.swing.JButton; import javax.swing.JComponent; import javax.swing.JFrame; import javax.swing.JPanel; import edu.uci.ics.jung.algorithms.layout.CircleLayout; import edu.uci.ics.jung.algorithms.layout.Layout; import edu.uci.ics.jung.graph.DirectedSparseGraph; import edu.uci.ics.jung.visualization.RenderContext; import edu.uci.ics.jung.visualization.VisualizationViewer; import edu.uci.ics.jung.visualization.control.DefaultModalGraphMouse; import edu.uci.ics.jung.visualization.control.ModalGraphMouse; import edu.uci.ics.jung.visualization.picking.PickedState; import edu.uci.ics.jung.visualization.renderers.Renderer; import edu.uci.ics.jung.visualization.transform.shape.GraphicsDecorator; class MyFocusListener implements FocusListener { @Override public void focusGained(FocusEvent fe) { // TODO Auto-generated method stub Object obj = fe.getSource(); System.out.println(obj.getClass() + " gained focus"); } @Override public void focusLost(FocusEvent fe) { // TODO Auto-generated method stub Object obj = fe.getSource(); System.out.println(obj.getClass() + " lost focus"); } }; public class GraphPanel extends Container { static final long serialVersionUID = 420001L; DirectedSparseGraph<Number, Number> graph = null; VisualizationViewer<Number, Number> vv = null; PickedState<Number> pickedState = null; public GraphPanel(Number[][] nodes_list) { try { graph = new DirectedSparseGraph<Number, Number>(); construct_graph(nodes_list); vv = new VisualizationViewer<Number, Number> (new CircleLayout<Number, Number>(graph), new Dimension(400, 400)); vv.getRenderer().setVertexRenderer(new MyRenderer()); vv.addFocusListener(new MyFocusListener()); // The vertex pick listener pickedState = vv.getPickedVertexState(); pickedState.addItemListener(new ItemListener() { @Override public void itemStateChanged(ItemEvent e) { Object subject = e.getItem(); if (subject instanceof Number) { Number vertex = (Number) subject; if (pickedState.isPicked(vertex)) { System.out.println("Vertex " + vertex + " is now selected"); } else { System.out.println("Vertex " + vertex + " no longer selected"); } if(e.getStateChange() == ItemEvent.SELECTED) { System.out.println("Vertex " + vertex + " state is:" + e.getStateChange()); } else { System.out.println("Vertex " + vertex + " state is:" + e.getStateChange()); } } } }); // The following code adds capability for mouse picking of // vertices/edges. Vertices can even be moved! final DefaultModalGraphMouse<Number, Number> graphMouse = new DefaultModalGraphMouse<Number, Number>(); vv.setGraphMouse(graphMouse); graphMouse.setMode(ModalGraphMouse.Mode.PICKING); } catch (Exception e) { System.err.println("Failed to construct graph!\n"); System.err.println("Caught Exception: " + e.getMessage()); } } /*Attach the graph panel/container to a specified frame*/ public void attach_to_frame(JFrame frame) { frame.setContentPane(vv); } private void construct_graph(Number[][] nodes_list) { |
From: SourceForge.net <no...@so...> - 2013-02-09 13:46:36
|
The following forum message was posted by akrambadreldin at http://sourceforge.net/projects/jung/forums/forum/252062/topic/1658925: Hi , how could we use JUNG 2 to get image tiles from any part of the graph, and at any scale/translation/rotation/etc." please i need your help :( |
From: Akram B. <eng...@ho...> - 2013-02-09 13:27:03
|
Dears , I want you help please , i need to export whole JUNG graph to an image, not only the visible part , i searched most of your posts but found nothing I read in some topics that JUNG 2 that can support this but i found nothing , please you help Thanks Akram Badr |
From: SourceForge.net <no...@so...> - 2013-02-09 13:02:26
|
The following forum message was posted by akrambadreldin at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6733414: Dears , I want you help please , i need to export whole JUNG to an image not only the visible part , i searched most of your posts but found nothing I read in some topics that JUNG 2 that can support this but i found nothing , please you help Thanks Akram Badr |
From: Simone G. <sim...@gm...> - 2013-01-25 14:30:57
|
Dear List, I would like to implement a bipartite network in my project using JUNG. Could you please point me to some example code, if any? Best, Simone -- Simone Gabbriellini, PhD PostDoc@DISI, University of Bologna mobile: +39 340 39 75 626 email: sim...@un... home: www.digitaldust.it DigitalBrains srl Amministratore mobile: +39 340 39 75 626 email: sim...@di... home: www.digitalbrains.it |
From: SourceForge.net <no...@so...> - 2013-01-22 13:12:52
|
The following forum message was posted by smcco27 at http://sourceforge.net/projects/jung/forums/forum/252062/topic/6666796: Hi all, I followed the example found in Section 5.4/page 12 of the tutorial found at www.grotto-networking.com/JUNG/JUNG2-Tutorial.pdf. However, when I right click on the GUI to add/remove a vertex/edge, previous options that were available to me as well as the current options available appear in the pop-up menu i.e. the more I right click on the GUI, the more options that become available to me. Is there a way to fix this such that only current options are available to me? I am using Jung 2.0.1. Thanks. |
From: Federico T. <f.t...@gm...> - 2013-01-21 10:50:11
|
Hi, I would like to know how I can resize vertexes. I have 3K of them and I would like to simply use a smaller circle, Federico -- Website at http://www.federico-tomassetti.it Indirizzo PEC fed...@or... |