Joshua O'Madadhain

Show:

What's happening?

  • Followup: RE: Source code?

    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.

    2013-04-27 09:19:33 PDT in Java Universal Ne...

  • Followup: RE: girvan newman graph generator

    No. You should be able to implement it yourself using the existing graph generators as a guide, however. Joshua.

    2013-03-12 13:27:35 PDT in Java Universal Ne...

  • Followup: RE: create a graph with specified degrees

    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.

    2013-01-07 10:25:19 PST in Java Universal Ne...

  • Followup: RE: Edge problem with irregular circle layout

    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.

    2013-01-05 13:04:36 PST in Java Universal Ne...

  • Followup: RE: Assign weight to a node & calculate ...

    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.

    2012-12-27 20:36:39 PST in Java Universal Ne...

  • Followup: RE: Assign weight to a node & calculate ...

    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.

    2012-12-22 08:46:30 PST in Java Universal Ne...

  • Followup: RE: code examples

    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.

    2012-12-19 10:23:32 PST in Java Universal Ne...

  • Followup: RE: Vertex overlap in visualization viewer

    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.

    2012-12-05 10:20:11 PST in Java Universal Ne...

  • Followup: RE: create multiple graphs during loop

    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...

    2012-11-20 13:39:21 PST in Java Universal Ne...

About Me


Send me a message