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: Victor P. <po...@na...> - 2017-12-27 18:48:03
|
I am implementing this ambitious free software in Java: https://en.wikiversity.org/wiki/Automatic_transformation_of_XML_namespa ces I need a graph library. I am now choosing JUNG vs JGraphT. Now I have the following requirements: 1. Check existence of a path between two vertices. 2. Invert (replace every edge with the opposite edge) a directed graph. 3. Calculate "mathematical" relational composition of two binary relations represented as directed graphs. My requirements may expand in the future. Please explain how to do each of my requirements in both JUNG and JGraphT and help to choose between these two. Thanks in advance. |
From: Joshua O'M. <jos...@gm...> - 2015-05-03 18:03:14
|
You'll need to implement the Layout interface, just as the other layout implementations in JUNG do. I'd recommend starting by looking at the existing implementations for some guidance. On Fri, May 1, 2015 at 1:27 AM, Promotie <pro...@zi...> wrote: > Oke I am busy building nodes and edges in JavaFX now. But rather use > JUNG. Is there some pointer or example in how to begin writing this > algorithm? > > > > *From:* Joshua O'Madadhain [mailto:jos...@gm...] > *Sent:* vrijdag 1 mei 2015 01:05 > *To:* Ziggo mail > *Cc:* JUNG SUPPORT > *Subject:* Re: [Jung-support] JUNG and lanes (swimlanes) > > > > Broadly speaking, yes, but you'd need to write your own layout algorithm > that puts nodes in lanes according to the clusters that you've assigned > them to. > > > > On Thu, Apr 30, 2015 at 11:25 AM, Ziggo mail <pro...@zi...> wrote: > > I want to cluster my outcome in predefined layers (or swimlanes). Does > anyone has any idea if this is possible in combination with Jung? > > > > Thanks in advance > > > > ------------------------------------------------------------------------------ > One dashboard for servers and applications across Physical-Virtual-Cloud > Widest out-of-the-box monitoring support with 50+ applications > Performance metrics, stats and reports that give you Actionable Insights > Deep dive visibility with transaction tracing using APM Insight. > http://ad.doubleclick.net/ddm/clk/290420510;117567292;y > _______________________________________________ > Jung-support mailing list > Jun...@li... > https://lists.sourceforge.net/lists/listinfo/jung-support > > > > > > -- > > jos...@gm.........sites.google.com/site/joshuaomadadhain/ > Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall > It's that moment of dawning comprehension that I live for. -- Bill > Watterson > My opinions are too rational and insightful to be those of any > organization. > -- jos...@gm.........sites.google.com/site/joshuaomadadhain/ Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall It's that moment of dawning comprehension that I live for. -- Bill Watterson My opinions are too rational and insightful to be those of any organization. |
From: Joshua O'M. <jos...@gm...> - 2015-04-30 23:04:46
|
Broadly speaking, yes, but you'd need to write your own layout algorithm that puts nodes in lanes according to the clusters that you've assigned them to. On Thu, Apr 30, 2015 at 11:25 AM, Ziggo mail <pro...@zi...> wrote: > I want to cluster my outcome in predefined layers (or swimlanes). Does > anyone has any idea if this is possible in combination with Jung? > > > > Thanks in advance > > > ------------------------------------------------------------------------------ > One dashboard for servers and applications across Physical-Virtual-Cloud > Widest out-of-the-box monitoring support with 50+ applications > Performance metrics, stats and reports that give you Actionable Insights > Deep dive visibility with transaction tracing using APM Insight. > http://ad.doubleclick.net/ddm/clk/290420510;117567292;y > _______________________________________________ > Jung-support mailing list > Jun...@li... > https://lists.sourceforge.net/lists/listinfo/jung-support > > -- jos...@gm.........sites.google.com/site/joshuaomadadhain/ Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall It's that moment of dawning comprehension that I live for. -- Bill Watterson My opinions are too rational and insightful to be those of any organization. |
From: Ziggo m. <pro...@zi...> - 2015-04-30 18:41:41
|
I want to cluster my outcome in predefined layers (or swimlanes). Does anyone has any idea if this is possible in combination with Jung? Thanks in advance |
From: Joshua O'M. <jos...@gm...> - 2015-04-30 02:08:51
|
This is the class you want: http://jung.sourceforge.net/doc/api/edu/uci/ics/jung/algorithms/filters/VertexPredicateFilter.html and here is a related StackOverflow question: http://stackoverflow.com/questions/3162297/extracting-a-subgraph-from-a-graph-using-jung On Tue, Apr 28, 2015 at 2:27 AM, jendoubi siwar <jen...@ya...> wrote: > Hello, > > I just started to use the java jung library. I have a sparse network and I > want to filter it (node based filter) in order to obtain a connected > network. I am looking for a code example of filtring networks with jung. > > Siwar. > > > ------------------------------------------------------------------------------ > One dashboard for servers and applications across Physical-Virtual-Cloud > Widest out-of-the-box monitoring support with 50+ applications > Performance metrics, stats and reports that give you Actionable Insights > Deep dive visibility with transaction tracing using APM Insight. > http://ad.doubleclick.net/ddm/clk/290420510;117567292;y > _______________________________________________ > Jung-support mailing list > Jun...@li... > https://lists.sourceforge.net/lists/listinfo/jung-support > > -- jos...@gm.........sites.google.com/site/joshuaomadadhain/ Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall It's that moment of dawning comprehension that I live for. -- Bill Watterson My opinions are too rational and insightful to be those of any organization. |
From: jendoubi s. <jen...@ya...> - 2015-04-28 09:28:17
|
Hello, I just started to use the java jung library. I have a sparse network and I want to filter it (node based filter) in order to obtain a connected network. I am looking for a code example of filtring networks with jung. Siwar. |
From: imen M. <ime...@gm...> - 2015-03-25 16:32:14
|
Hello, I have a problem with graphmlreader2 for this nested graph <node id="Wheat(G:2),Wheat(G:1)"> <graph edgedefault="directed"> <node id="structData:1:0"> <data key="displayValue">Wheat</data> <data key="idSrcOrigin">1413280515</data> </node> <node id="structData:11:11"> <data key="displayValue">Wheat</data> <data key="idSrcOrigin">-858940630</data> </node> </graph> </node> I want to get the nodes in the sub graph of the node with the id "Wheat(G:2),Wheat(G:1)" , Is there some examples to help us Thank you !! |
From: Joshua O'M. <jos...@gm...> - 2015-02-04 18:14:57
|
Use GraphMLWriter: https://halfclosed.wordpress.com/2010/12/04/graphml-with-jung-saving/ On Wed, Feb 4, 2015 at 8:24 AM, imen Megdiche <ime...@gm...> wrote: > Hi, > > How can I store a graph issued from a graphcollapser in an xml file ?? > > Thank you in advance , > > Imen > > > ------------------------------------------------------------------------------ > Dive into the World of Parallel Programming. The Go Parallel Website, > sponsored by Intel and developed in partnership with Slashdot Media, is > your > hub for all things parallel software development, from weekly thought > leadership blogs to news, videos, case studies, tutorials and more. Take a > look and join the conversation now. http://goparallel.sourceforge.net/ > _______________________________________________ > Jung-support mailing list > Jun...@li... > https://lists.sourceforge.net/lists/listinfo/jung-support > > -- jos...@gm.........sites.google.com/site/joshuaomadadhain/ Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall It's that moment of dawning comprehension that I live for. -- Bill Watterson My opinions are too rational and insightful to be those of any organization. |
From: imen M. <ime...@gm...> - 2015-02-04 16:24:25
|
Hi, How can I store a graph issued from a graphcollapser in an xml file ?? Thank you in advance , Imen |
From: Joshua O'M. <jos...@gm...> - 2015-01-04 18:34:55
|
Rachel: 2.0.1 is the latest version of JUNG. The package "jung2" is arguably somewhat confusingly named; sorry for the confusion. Joshua O'Madadhain On Mon, Dec 29, 2014 at 4:48 AM, Rachel Tzoref <RA...@il...> wrote: > Hi, > > I am looking for the sources of Jung version 2.2. The sources that come > with 2.2 on sourceforge (in jung2-2_0_1-sources.zip) are all labelled as > 2.0.1. Does this mean they are in fact not the sources of 2.2 but rather of > 2.0.1? If so, where can I find the 2.2 sources? > > Thanks, > Rachel > > > > > ------------------------------------------------------------------------------ > Dive into the World of Parallel Programming! The Go Parallel Website, > sponsored by Intel and developed in partnership with Slashdot Media, is > your > hub for all things parallel software development, from weekly thought > leadership blogs to news, videos, case studies, tutorials and more. Take a > look and join the conversation now. http://goparallel.sourceforge.net > _______________________________________________ > Jung-support mailing list > Jun...@li... > https://lists.sourceforge.net/lists/listinfo/jung-support > > -- jos...@gm.........sites.google.com/site/joshuaomadadhain/ Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall It's that moment of dawning comprehension that I live for. -- Bill Watterson My opinions are too rational and insightful to be those of any organization. |
From: Rachel T. <RA...@il...> - 2014-12-29 13:18:42
|
Hi, I am looking for the sources of Jung version 2.2. The sources that come with 2.2 on sourceforge (in jung2-2_0_1-sources.zip) are all labelled as 2.0.1. Does this mean they are in fact not the sources of 2.2 but rather of 2.0.1? If so, where can I find the 2.2 sources? Thanks, Rachel |
From: Roald A. <ro...@an...> - 2014-12-03 21:14:03
|
Hi When using Jung 2.0.1 more or less out-of-the-box, the popup menu created by EditingPopupGraphMousePlugin behaves weird. For each time I click the right mouse button, a new "Create Vertex" entry is added to the popup menu. Looking at the source of EditingPopupGraphMousePlugin.handlePopup(MouseEvent e), it seems to me that this menu entry is each time the popup menu is to be displayed. Is this expected behaviour? If so, is there any way I can prevent it? Naturally, if it is not expected behaviour, it needs to be looked into. I can certainly do that, but I wouldn't want to step in someone elses code unneccessarily. With kind regards, Roald Andresen |
From: Joshua O'M. <jos...@gm...> - 2014-11-08 20:06:49
|
Responded on StackOverflow. On Sat, Oct 25, 2014 at 8:43 PM, Scott Klarenbach <sc...@po...> wrote: > For additional context, please see this stackoverflow question: > > > http://stackoverflow.com/questions/26470950/jung-graph-pagerank-with-undirected-graph-and-weighted-edges > > -- > Talk to you soon, > > Scott Klarenbach > > PointyHat Software Corp. > www.pointyhat.ca > p 604-568-4280 > e sc...@po... > 2404 Guelph Street > Suite A > Vancouver, BC, V5T3P3 > > _______________________________________ > To iterate is human; to recur, divine > > > ------------------------------------------------------------------------------ > > _______________________________________________ > Jung-support mailing list > Jun...@li... > https://lists.sourceforge.net/lists/listinfo/jung-support > > -- jos...@gm.........sites.google.com/site/joshuaomadadhain/ Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall It's that moment of dawning comprehension that I live for. -- Bill Watterson My opinions are too rational and insightful to be those of any organization. |
From: Joshua O'M. <jos...@gm...> - 2014-11-07 18:00:45
|
It was never ported over. It's a pretty trivial implementation, and there was essentially no demand for it. Note that every bipartite graph can be represented as a hypergraph, and vice versa. What does your bipartite graph represent? On Fri, Nov 7, 2014 at 3:34 AM, Spencer Bliven <sb...@uc...> wrote: > Hey, I'm new to JUNG and was hoping to use it for bipartite graphs. JUNG2 > doesn't seem to have any implementations of KPartiteGraph. Am I missing a > module, or was it just never ported over from 1.7.6? > > Thanks, > Spencer > > > ------------------------------------------------------------------------------ > > _______________________________________________ > Jung-support mailing list > Jun...@li... > https://lists.sourceforge.net/lists/listinfo/jung-support > > -- jos...@gm.........sites.google.com/site/joshuaomadadhain/ Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall It's that moment of dawning comprehension that I live for. -- Bill Watterson My opinions are too rational and insightful to be those of any organization. |
From: Spencer B. <sb...@uc...> - 2014-11-07 11:34:41
|
Hey, I'm new to JUNG and was hoping to use it for bipartite graphs. JUNG2 doesn't seem to have any implementations of KPartiteGraph. Am I missing a module, or was it just never ported over from 1.7.6? Thanks, Spencer |
From: Scott K. <sc...@po...> - 2014-10-26 03:43:29
|
For additional context, please see this stackoverflow question: http://stackoverflow.com/questions/26470950/jung-graph-pagerank-with-undirected-graph-and-weighted-edges -- Talk to you soon, Scott Klarenbach PointyHat Software Corp. www.pointyhat.ca p 604-568-4280 e sc...@po... 2404 Guelph Street Suite A Vancouver, BC, V5T3P3 _______________________________________ To iterate is human; to recur, divine |
From: Scott K. <sc...@po...> - 2014-10-20 04:06:35
|
Hi there, I'm implementing PageRank on an undirected graph with weighted edges. My understanding is that because my graph is undirected, the transition probabilities representing edge weights will be different depending on the origin vertex. This makes sense, since the probabilities must total 1 for the outbound edges of the vertex, but each incident vertex of the edge will have different requirements, meaning I can't have a common transition probabilities between them. (If this understanding is wrong, please correct me). So, instead of the first approach to edge weights where I had an edge, v1, v2, weight, I started playing with VEPair, to see if that would allow me to implement multiple weights for the same edge depending on the vertex. But I'm getting null pointer exceptions in the update method of PageRank because the call to transform in AbstractIterativeScorer is newing up a new VEPair, and since there is no hashCode or equals implementation on the VEPair class, new instances with identical underlying values are not coming back from the transformer. If I *don't* key my transformer via VEPairs, but instead use simpler integers as before, everything works fine. I can override the required classes to make this work, but I wanted to check and see if I'm completely on the wrong track, since it seems funny that VEPair wouldn't be usable in transforms as is. It's quite possible that the mistake is on my end. Thanks a lot. -- Talk to you soon, Scott Klarenbach PointyHat Software Corp. www.pointyhat.ca p 604-568-4280 e sc...@po... 2404 Guelph Street Suite A Vancouver, BC, V5T3P3 _______________________________________ To iterate is human; to recur, divine |
From: Darío T. <dar...@gm...> - 2014-07-29 09:21:59
|
Hello New bug and description DefaultEdgeLabelRenderer ignores Foreground and Background. To make it aware of it, is enough with public <E> Component getEdgeLabelRendererComponent(JComponent vv, Object value, Font font, boolean isSelected, E edge) { *// delete this line super.setForeground(vv.getForeground());* if(isSelected) setForeground(pickedEdgeLabelColor); *// **delete this line** super.setBackground(vv.getBackground());* if(font != null) { setFont(font); } else { setFont(vv.getFont()); } setIcon(null); setBorder(noFocusBorder); setValue(value); return this; } |
From: Darío T. <dar...@gm...> - 2014-07-24 12:05:15
|
2014-07-24 11:41 GMT+02:00 Darío Tórtola <dar...@gm...>: > Hello > > I have seen that there were not changes on JUNG for a while but there's > still bugs to address. > In particular, this email is motivated by > http://sourceforge.net/p/jung/bugs/168/ > > Please answer to know if this action is futile or otherwise, so I can > modify the sources and build a JUNG without the problems I find a solution, > or if I can expect you to do it (or to include me in the team) > > Here are my thoughts about the bug > > BUG 168 of the sourceforge list (http://sourceforge.net/p/jung/bugs/168/): > Took DirectedGraph g; > Wrap in ObservableGraph og; > Use EditingGraphMousePlugin to add edges to og; > > Since EditingGraphMousePlugin uses instanceof to detect what the default > type of edge, > and ObservableGraph doesn't implement it, it fails to use the right one. > I can immediately think of two solutions: > > 1. Add a new EdgeType Graph.getDefaultEdgeType() method. The default type > can be UNDIRECTED, > for some can be DIRECTED. > Modify EditingGraphMousePlugin to use the default type > Problem of this solution: you can write a DirectedGraph implementation > that returns UNDIRECTED as default type > > 2. Create a DirectedObservableGraph by extending ObservableGraph and > adding the DirectedGraph interface > Hide ObservableGraph's constructor > Use a static factory method to build either an ObservableGraph or > DirectedObservableGraph depending on the interfaces of the graph to be > wrapped > > To implement: > > *change: > public ObservableGraph(Graph<V, E> delegate) { > super(delegate); > } > *to: > private ObservableGraph(Graph<V, E> delegate) { > super(delegate); > } > > > *Add a private static class to ObservableGraph: > > package edu.uci.ics.jung.graph; > > private static class DirectedObservableGraph<V, E> extends > ObservableGraph<V, E> implements DirectedGraph<V, E> { > > /** > * > */ > private static final long serialVersionUID = 8643031744079601269L; > > public DirectedObservableGraph(Graph<V, E> delegate) { > super(delegate); > } > > } > > *Add a public static factory method to ObservableGraph > > public static <V, E> ObservableGraph<V, E> build (Graph<V, E> graph){ > if (graph instanceof DirectedGraph){ > return new DirectedObservableGraph<>(graph); > } > return new ObservableGraph<>(graph); > } > |
From: Anjenson <hot...@gm...> - 2014-07-20 16:59:18
|
Hi again, I have obtained JUNG code but I have failed to find the place where Relaxer fires the event. Could anyone, please, point out the place or explain this any other way? Regards, Andrew |
From: Anjenson <hot...@gm...> - 2014-07-10 16:24:51
|
Hi everyone, I am going to use force-based layout and I have got a question about Relaxer.relax() method. In documentation it is said that an event is fired after each step of the loop but the event itself is not specified. So could anyone, please, tell me which listener should I use to get the event and what is the event like? Regards, Andrew |
From: Joshua O'M. <jos...@gm...> - 2014-07-02 16:49:19
|
Debra: More or less in order... Splitting the data into two separate graphs seems reasonable. I would clarify that you don't put "copies" of the nodes in the new graph (in the sense that you are creating new objects) but references to the same objects. The way that you're describing what you've been doing suggests to me that you're somewhat confused between (a) the data model (i.e., representation in terms of data structures) (b) the visualization of that data You can certainly create a visualization that displays more than one graph. There is sample code in the distribution that gives examples of doing this. Some technical details: * You can declare your graph as Graph<Women, String> (or if you have an relation object that represents the relation, Graph<Women, Friendship> and Graph<Women, History>) rather than extracting the ID from your Women object. That way it's more clear what the Graph represents, and you have all the information in the original object in the same place. (Nor does it take up more space--the opposite, in fact, since you're not creating a new Integer object for each vertex.) * The easiest way to add each of the Women objects to both graphs is just to add them both in the same loop, as below. (In any case, addVertex() takes a single vertex--in this case, an Integer--and calling it on a Collection<Integer> won't work.) static Graph<Integer, String> g; static Graph<Integer, String> g2; for (Women aWoman : GaleShapely2.womenList) { g.addVertex(aWoman); g2.addVertex(aWoman); } Hope this helps. Joshua PS: FYI, you sent this to the owner of the jung-support list rather than to the list itself; I've taken the liberty of redirecting my response. Also, support questions are best sent to StackOverflow these days; that's where most of the questions relating to JUNG are being asked and answered. On Wed, Jul 2, 2014 at 5:53 AM, Debra Hevenstone <dhe...@gm...> wrote: > Hi Everyone, > > I have a program where I was running a simulation where I created one > network with two types of edges - first friendship edges, and then, once > friendship edges were generated, I ran a matching algorithm (Gale Shapely) > with information limited to one's local network, and saved those new edges > onto the original graph, just labeling them differently. > > I would like split this into 2 graphs: a friendship graph and a > relationship-history graph. I understand I can create a separate graph and > just put copies of the nodes in the new graph. > > My first graph was created in SimpleGraphView.java and in the constructor > I added all the vertices. > > My question is whether I can create the second graph (just the vertices, > before edges are created) in the same file, directly after the first graph. > It seems like it might be problematic in terms of visualization. On the > other hand, if I can't create the second graph there, I'm not sure where I > would create it. > > A shortened version of the original code is something like this: > > public class SimpleGraphView { > > static Graph<Integer, String> g; > > for (Women aWoman : GaleShapely2.womenList) { > > g.addVertex(aWoman.getID()); > > } > > } > > > I imagine the new code would be something like this: > > > public class SimpleGraphView { > > static Graph<Integer, String> g; > > static Graph<Integer, String> g2; > > for (Women aWoman : GaleShapely2.womenList) { > > g.addVertex(aWoman.getID()); > > } > > g2.addVertex(g.getVertices()); > > } > > Would that work? > -- jos...@gm.........sites.google.com/site/joshuaomadadhain/ Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall It's that moment of dawning comprehension that I live for. -- Bill Watterson My opinions are too rational and insightful to be those of any organization. |
From: Debra H. <dhe...@gm...> - 2014-07-02 13:10:46
|
Dear list serve, Please ignore the prior posting. I've figured it out. Thank You, Debra |
From: graviton6 <gra...@ya...> - 2014-06-22 09:54:34
|
I've got a gui app that has a 'parameters section' for each layout. in that parameters section, i would like to be able to dynamically set/get the parameters for any layout so that I can control how the layout works. Some layouts have proper get/set for their analytic parameters. some don't. I note that FRLayout api has: * setAttractionMultiplier(double attraction) * setRepulsionMultiplier(double repulsion) but there are no corresponding get methods. any reason for this? How are changes getting made to the src code? can I contribute? regards, CF> |
From: Jeffrey G. <gue...@gm...> - 2014-06-09 15:52:44
|
Thanks Jim! It’s good to hear of your interest. On Jun 8, 2014, at 9:31 AM, James Allen <ja...@ti...> wrote: > I'm only and end-user, but like what you are offering. > > Good luck! > > Jim > > On Jun 6, 2014, at 1:03 PM, Jeffrey Guenther <gue...@gm...> wrote: > >> Hi JUNG Devs, >> >> I'm looking to get a hold of the JUNG developers. I've been in contact with a couple other developers who are interested in updating JUNG for JavaFX. We'd like to use JUNG in our JavaFX applications and would like to improve the framework as we bump into issues. Our long-term goal is to update JUNG to work within the JavaFX and Java 8+ conventions (observable properties, lambdas, etc) >> >> What is the development status of JUNG? Who is currently responsible for the project? Would you be open to allowing us to continue developing JUNG under the JUNG name? We would maintain the 2.x series and start with a new version 3.x or 4.x for the update, depending if the guava collections version was ever officially released. >> >> We think JUNG is a great library and want keep it alive as JavaFX takes the place of Swing. >> >> Cheers, >> Jeff >> ------------------------------------------------------------------------------ >> Learn Graph Databases - Download FREE O'Reilly Book >> "Graph Databases" is the definitive new guide to graph databases and their >> applications. Written by three acclaimed leaders in the field, >> this first edition is now available. Download your free book today! >> http://p.sf.net/sfu/NeoTech_______________________________________________ >> Jung-support mailing list >> Jun...@li... >> https://lists.sourceforge.net/lists/listinfo/jung-support > |