Questions tagged [jung]

JUNG is an open-source Java library for representing, manipulating, analyzing, and visualizing graph and network data.

JUNG — the Java Universal Network/Graph Framework--is a software library that provides a common and extensible language for the modeling, analysis, and visualization of data that can be represented as a graph or network. It is written in Java, which allows JUNG-based applications to make use of the extensive built-in capabilities of the Java API, as well as those of other existing third-party Java libraries.

The JUNG architecture is designed to support a variety of representations of entities and their relations, such as directed and undirected graphs, multi-modal graphs, graphs with parallel edges, and hyper-graphs. It provides a mechanism for annotating graphs, entities, and relations with metadata. This facilitates the creation of analytic tools for complex data sets that can examine the relations between entities as well as the metadata attached to each entity and relation

The current distribution of JUNG includes implementations of a number of algorithms from graph theory, data mining, and social network analysis, such as routines for clustering, decomposition, optimization, random graph generation, statistical analysis, and calculation of network distances, flows, and importance measures (centrality, PageRank, HITS, etc.). JUNG also provides a visualization framework that makes it easy to construct tools for the interactive exploration of network data. Users can use one of the layout algorithms provided, or use the framework to create their own custom layouts. In addition, filtering mechanisms are provided which allow users to focus their attention, or their algorithms, on specific portions of the graph.

433 questions
0
votes
1 answer

Using jung2 in cytoscape plugins

I've taken up java for about a week and a half now with an eye toward writing cytoscape plugins and using jung2 to analyze and manipulate cytoscape graph objects. Is there any way to extend the cytoscape graph object call it class xyz to include a…
0
votes
1 answer

JUNG Export editable Graph in a VisualizationViewer into an image

I have an editable VisualizationViewer inside a GraphZoomScrollPane. After moving and reorganizing the graph I want to save the edited version into a image file. When I tried using VisualizationImageServer it requires the layout which removes the…
ghm1014
  • 675
  • 6
  • 12
0
votes
1 answer

How to implement a JUNG graph with mixed (directed and undirected) edges?

I have a GraphML file with both directed and un-directed edges. I want to read this file into a JUNG graph, but I can't find an appropriate implementation that would support graphs of mixed edge-types. Is there such an implementation? Or, any hints…
user1030497
  • 183
  • 1
  • 1
  • 14
0
votes
1 answer

JUNG Exception in "main" :org/apache/commons/collections/Predicate

I am getting started with Java Universal Network/Graph Framework (JUNG). I am trying to build a basic graph using the same. I downloaded the jung 2.0.1 libraries. collections-generic-4.0.1.jar and colt-1.2.0.jar. I added all the included libraries…
0
votes
1 answer

Tree Graph Layout Algorithm

I have an acyclic graph - a tree. Each node of the graph will have some attributes that I need to show in a glyph. Let's us say the size of each Glyph is 100x100 pixels. I am looking for an algorithm that is fast and efficient for up to 100,000…
user1172468
  • 5,306
  • 6
  • 35
  • 62
0
votes
2 answers

extract sublist of concrect product from a list of abstract product

I construct an Hyper graph using jung library Hypergraph hypergraph = new SetHyperGraph(); then I add all my vertex (image , tag , location) hypergraph.addVertex() ArrayList allVertex =…
nawara
  • 1,157
  • 3
  • 24
  • 49
0
votes
1 answer

Global instance of an object

Actually , I use jung library to construct my hyper graph. I want to use only one instance of hyper graph all over my application so that I can't access it and mofify it from any class in my application (to add vertex, to add a hyperEdge, etc.). It…
nawara
  • 1,157
  • 3
  • 24
  • 49
0
votes
2 answers

Calculating weight of subgrah

I need to ask for your help, as I've been struggling with my problem for many days and didn't find any suitable solution. I want to find weight of subgrah that contains node (going to be a parameter of my method) and will end with central node 0. I…
ZeeLoony
  • 60
  • 7
0
votes
1 answer

JUNG Pagerank edge weight issue

I am new to Gremlin and I am trying to implement the pagerank algorithm with edge weights from JUNG. These are the steps I have taken. I have 2.0.0.0 version of Gremlin installed. I have created a .graphml file using the iGraph package in R, which I…
user2172699
  • 21
  • 2
  • 4
0
votes
2 answers

Jung2: how to disable node selfloop

I would like to make a simple graph which is a graph without node's selfloop. In tutorial that is avaiable online it is said that I should use SimpleGraph interface, however it isn't working as it is not found in any jar. Is there something I can do…
ZeeLoony
  • 60
  • 7
0
votes
1 answer

Fast way of determining whether two nodes in a JUNG graph are connected by more than one path?

Given two nodes A and B from a directed JUNG graph, I want to determine whether there is more than one path from A to B (not necessarely a shortest path). I can think of two approaches only, both very time-consuming. Retrieve all paths…
Alphaaa
  • 4,206
  • 8
  • 34
  • 43
0
votes
1 answer

Jung Java Graph How to set ID on vertex in view

I use Jung Java library to create simple graph. I want to display vertex's ids on view but now I have rendered only a graph without this. How to do that?
Sheppard25
  • 493
  • 1
  • 7
  • 22
0
votes
1 answer

Gremlin: SetProperty iteratively to existing graph database

I am trying to run JUNGs PageRank algorithm onto my existing neo4j graph database and save a node's score as a property for future reference. So I created the following groovy file: import edu.uci.ics.jung.algorithms.scoring.PageRank g = new…
zanbri
  • 5,958
  • 2
  • 31
  • 41
0
votes
1 answer

Weighted Graph DijkstraShortestPath : getpath() does not return path with least cost

Thanks for prompt response chessofnerd and Joshua.I am sorry for unclear logsand unclear question.Let me rephrase it. Joshua: I am storing my weights in DB and retrieving from DB in transformer. I have 4 devices connected in my topology and …
Chandra
  • 1
  • 2
0
votes
1 answer

Jung2: how to connect all nodes at once

I would like to ask is there any way to connect all nodes using one and simple method from Jung2 API. I would like to get full graph for the nodes that I did place on my canvas.