Take a look:

 - [GEF][6] - GUI components for graphical editing, including graphs, (Eclipse) SWT based
 - [JGraphX][11] - former JGraph, not actively developed since March 2020
 - [Piccolo2D][9] - (Eclipse) SWT based
 - [JUNG][2] - last released in 2010 (as of 2020); was very popular back then
 - [yWorks][4] - not open source, not free
 - [JGraphT][1] - data handling and algorithms only, no integrated visualizaiton, though supports [JGraphX][11] visualization


  [1]: http://jgrapht.org/
  [2]: http://jung.sourceforge.net/
  [4]: http://www.yworks.com/en/products_yfiles_about.html
  [6]: https://www.eclipse.org/gef/
  [9]: http://piccolo2d.org/community.html
  [11]: https://github.com/jgraph/jgraphx

Take a look at [GraphStream](http://graphstream-project.org/), as shown from their [demo video](http://www.youtube.com/watch?feature=player_embedded&amp;v=XX5rRF6uxow) you can do some fancy stuff with graphs using their library. 

[Prefuse][1] is pretty and powerful. The website is no longer there so here is an [archived version][2]


  [1]: http://prefuse.org/
  [2]: https://web.archive.org/web/20181226190156/http://prefuse.org/

Have you had a look at [Processing][1], or [Processing.js][2]? There are some [amazing][3] vis projects being made with this.

Not strictly Java, but easy to integrate within a Java environment, if I recall correctly.


  [1]: http://en.wikipedia.org/wiki/Processing_(programming_language)
  [2]: http://en.wikipedia.org/wiki/Processing.js
  [3]: http://processing.org/exhibition/

Another option if feasible is to construct text file in [graphviz dot format][1]  and process it using various tools provided. Mostly helpful for generate static images 

See [graphviz gallery][2] for more details 

![enter image description here][3]


  [1]: http://www.graphviz.org/
  [2]: http://www.graphviz.org/Gallery.php
  [3]: http://i.stack.imgur.com/BGNsg.png

You may also want to have a look at [wilmascope][1] (or its [project page][2]). I used it a few years ago after full research and was quite happy with it, but it has not been updated since 2004 (as of 2020). 


  [1]: http://wilma.sourceforge.net
  [2]: https://sourceforge.net/projects/wilma/

I just discovered that at one point, the C++11 draft had `std::begin`/`std::end` overloads for `std::pair` that allowed treating a pair of iterators as a range suitable for use in a range-based for loop (N3126, section 20.3.5.5), but this has since been removed.

Does anyone know why it was removed?

I find the removal very unfortunate, because it seems there is no other way to treat a pair of iterators as a range. Indeed:

- The lookup rules for begin/end in a range-based for loop say that begin/end are looked for in 1) as member functions of the range object 2) as free functions in &quot;associated namespaces&quot;
- `std::pair` does not have begin/end member functions
- The only associated namespace for `std::pair&lt;T, U&gt;` in general is namespace std
- We are not allowed to overload `std::begin`/`std::end` for `std::pair` ourselves
- We cannot specialize `std::begin`/`std::end` for `std::pair` (because the specialization would have to be partial and that&#39;s not allowed for functions)

Is there some other way that I am missing?

Why was pair range access removed from C++11?

This would be question from c# beginner. 
When I create console application I get Main method with parameter **args** as array string.
I do not understand how this method is called by system and how args are passed to the Main method. Maybe someone could explain?  Is Main method are overridden of some kind of console class?

    namespace ConsoleApplication1
    {
        class Program
        {    
            static void Main(string[] args)
            {    
            }
        }
    }

Console app arguments, how arguments are passed to Main method

I am in need of Java library for graphs that supports dynamic visualization. I need to have objects moving between the vertices and this has to be shown. 3D is not needed, a 2D representation will suffice.

I am currently using *JUNG* but it is very limited, it is more for static graphs from what I can tell.

I have looked at [this][1] question but *JGraphT* doesn&#39;t seem to do it either.

---

*Late Edit:*

I waited to finish the project before awarding an answer. I ended up keeping JUNG, while also using [UBIGraph][2] (dead project since 2012) as a secondary library.


  [1]: https://stackoverflow.com/questions/51574/good-java-graph-algorithm-library
  [2]: http://ubietylab.net/ubigraph/

Java graph library for dynamic visualisation

I am in need of Java library for graphs that supports dynamic visualization. I need to have objects moving between the vertices and this has to be shown. 3D is not needed, a 2D representation will suffice.
I am currently using JUNG but it is very limited, it is more for static graphs from what I can tell.
I have looked at <a href="https://stackoverflow.com/questions/51574/good-java-graph-algorithm-library" target="_blank" rel="noopener noreferrer">this</a> question but JGraphT doesn't seem to do it either.
<hr>
Late Edit:
I waited to finish the project before awarding an answer. I ended up keeping JUNG, while also using <a href="http://ubietylab.net/ubigraph/" target="_blank" rel="noopener noreferrer">UBIGraph</a> (dead project since 2012) as a secondary library.

I am trying to to understand **why Java&#39;s ArrayDeque is better than Java&#39;s LinkedList** as they both implement Deque interface. 

I hardly see someone using ArrayDeque in their code. If someone sheds more light into how ArrayDeque is implemented, it would be helpful. 

If I understand it, I will be more confident using it. I could not clearly understand the JDK implementation as to the way it manages head and tail references.

Why is ArrayDeque better than LinkedList

Although this question asked many times and I have already used all the suggestion but still I am getting this error.

The User.java is

    @Entity
	@Table(name = &quot;USER&quot;)
	public class User implements UserDetails, Serializable {
	
		private static final long serialVersionUID = 2L;
	
		@Id
		@Column(name = &quot;USER_ID&quot;)
		@GeneratedValue(strategy = GenerationType.IDENTITY)
		private long id;
		@Column(name = &quot;USERNAME&quot;)
		private String username;
		@Column(name = &quot;PASSWORD&quot;)
		private String password;
		@Column(name = &quot;NAME&quot;)
		private String name;
		@Column(name = &quot;EMAIL&quot;)
		private String email;
		@Column(name = &quot;LOCKED&quot;)
		private boolean locked;
		@OneToMany(cascade=CascadeType.ALL, fetch = FetchType.EAGER)
		@ElementCollection(targetClass=Role.class)
		@Column(name = &quot;ROLE_ID&quot;)
		private Set&lt;Role&gt; roles;
	
		@Override
		public GrantedAuthority[] getAuthorities() {
			List&lt;GrantedAuthorityImpl&gt; list = new ArrayList&lt;GrantedAuthorityImpl&gt;(0);
			for (Role role : roles) {
				list.add(new GrantedAuthorityImpl(role.getRole()));
			}
			return (GrantedAuthority[]) list.toArray(new GrantedAuthority[list.size()]);
		}
	
		@Override
		public boolean isAccountNonExpired() {
			return true;
		}
	
		@Override
		public boolean isAccountNonLocked() {
			return !isLocked();
		}
	
		@Override
		public boolean isCredentialsNonExpired() {
			return true;
		}
	
		@Override
		public boolean isEnabled() {
			return true;
		}
	
		public long getId() {
			return id;
		}
	
		public void setId(long id) {
			this.id = id;
		}
	
		public String getName() {
			return name;
		}
	
		public void setName(String name) {
			this.name = name;
		}
	
		public String getEmail() {
			return email;
		}
	
		public void setEmail(String email) {
			this.email = email;
		}
	
		public boolean isLocked() {
			return locked;
		}
	
		public void setLocked(boolean locked) {
			this.locked = locked;
		}
	
		@Override
		public String getUsername() {
			return username;
		}
	
		public void setUsername(String username) {
			this.username = username;
		}
	
		@Override
		public String getPassword() {
			return password;
		}
	
		public void setPassword(String password) {
			this.password = password;
		}
	
		public void setRoles(Set&lt;Role&gt; roles) {
			this.roles = roles;
		}
	
		public Set&lt;Role&gt; getRoles() {
			return roles;
		}
	}

And the Role.java is

    @Entity
	@Table(name=&quot;ROLE&quot;)
	public class Role implements Serializable {
	
		@Id
		@GeneratedValue(strategy = GenerationType.IDENTITY)
		@Column(name=&quot;ROLE_ID&quot;)
		private long id;
		@Column(name=&quot;USERNAME&quot;)
		private String username;
		@Column(name=&quot;ROLE&quot;)
		private String role;
	
		
		public long getId() {
			return id;
		}
	
		public void setId(long id) {
			this.id = id;
		}
	
		public String getUsername() {
			return username;
		}
	
		public void setUsername(String username) {
			this.username = username;
		}
	
		public String getRole() {
			return role;
		}
	
		public void setRole(String role) {
			this.role = role;
		}
	}

This is my first attempt in hibernate annotation with JPA. So any suggestions will be very helpful. 

For hibernate the pom.xml&#39;s dependencies are:

        &lt;dependency&gt;
			&lt;groupId&gt;org.hibernate&lt;/groupId&gt;
			&lt;artifactId&gt;hibernate&lt;/artifactId&gt;
			&lt;version&gt;3.5.4-Final&lt;/version&gt;
			&lt;type&gt;pom&lt;/type&gt;
			&lt;scope&gt;compile&lt;/scope&gt;
		&lt;/dependency&gt;
		&lt;dependency&gt;
			&lt;groupId&gt;org.hibernate&lt;/groupId&gt;
			&lt;artifactId&gt;hibernate-annotations&lt;/artifactId&gt;
			&lt;version&gt;3.5.4-Final&lt;/version&gt;
			&lt;type&gt;jar&lt;/type&gt;
			&lt;scope&gt;compile&lt;/scope&gt;
		&lt;/dependency&gt;
		
		&lt;dependency&gt;
			&lt;groupId&gt;org.hibernate&lt;/groupId&gt;
			&lt;artifactId&gt;hibernate-core&lt;/artifactId&gt;
			&lt;version&gt;3.5.4-Final&lt;/version&gt;
			&lt;type&gt;jar&lt;/type&gt;
			&lt;scope&gt;compile&lt;/scope&gt;
		&lt;/dependency&gt;
		&lt;dependency&gt;
			&lt;groupId&gt;org.hibernate&lt;/groupId&gt;
			&lt;artifactId&gt;hibernate-validator&lt;/artifactId&gt;
			&lt;version&gt;3.1.0.GA&lt;/version&gt;
			&lt;type&gt;jar&lt;/type&gt;
			&lt;scope&gt;compile&lt;/scope&gt;
		&lt;/dependency&gt;
		&lt;dependency&gt;
			&lt;groupId&gt;org.hibernate&lt;/groupId&gt;
			&lt;artifactId&gt;hibernate-entitymanager&lt;/artifactId&gt;
			&lt;version&gt;3.5.4-Final&lt;/version&gt;
			&lt;type&gt;jar&lt;/type&gt;
			&lt;scope&gt;compile&lt;/scope&gt;
		&lt;/dependency&gt;

I have no clue about the fault.

Thanks.

org.hibernate.MappingException: Could not determine type for: java.util.Set

Is there a way to convert this:

    /C:/Users/David/Dropbox/My%20Programs/Java/Test/bin/myJar.jar
into this?:

    C:\Users\David\Dropbox\My Programs\Java\Test\bin\myJar.jar

I am using the following code, which will return the full path of the .JAR archive, or the /bin directory.

    fullPath = new String(MainInterface.class.getProtectionDomain()
    			.getCodeSource().getLocation().getPath());

The problem is, `getLocation()` returns a `URL` and I need a normal windows filename.
I have tried adding the following after `getLocation()`:

`toString()` and `toExternalForm()` both return:
	
    file:/C:/Users/David/Dropbox/My%20Programs/Java/Test/bin/

`getPath()` returns:
	
    /C:/Users/David/Dropbox/My%20Programs/Java/Test/bin/

Note the `%20` which should be converted to space.
  
Is there a quick and easy way of doing this? 

Convert URL to normal windows filename Java

Is there a good tool that can help to reverse engineer Java classes to UML that will show an overview of how my classes are related to each other? It doesn&#39;t need to decompile from JAR file because I have the sources. I know there are quite a few out there but most of those can only generate individual class. I hope there is a tool that can generate class diagram that shows an overview of how all my current classes and packages work together, so that I can analyse my current architecture design. Of course, analysing is one thing. The other is for documentation purposes. 

I know of a few so far. But they cannot do an overview class diagram. Here&#39;s a list of Java UML tool that I have tried and is capable of doing reverse engineer but cannot do an overview class diagram of my whole project:

- StarUML (Really good &lt;s&gt;Opensource&lt;/s&gt; UML tool but cannot generate not overview class diagram)
- ArgoUML (It is slow and sluggish and it keeps crashing)
- UModel (This is a commerical software. I used before some time ago but found it difficult to use)
- MS Visio (It doesn&#39;t support Java UML reverse engineer. Only for VB)

Are there any other recommendations to add to this list? And hopefully, can generate an overview Java class diagram. I am using Eclipse, by the way.

Generate UML Class Diagram from Java Project

How can I find an index of a certain value in a Java array of type `int`?

I tried using `Arrays.binarySearch` on my unsorted array, it only sometimes gives the correct answer.

How to find the index of an element in an int array?

I am the developer of some family tree software (written in C++ and Qt). I had no problems until one of my customers mailed me a bug report. The problem is that the customer has two children with their own daughter, and, as a result, he can&#39;t use my software because of errors.

Those errors are the result of my various assertions and invariants about the family graph being processed (for example, after walking a cycle, the program states that X can&#39;t be both father and grandfather of Y).

How can I resolve those errors without removing all data assertions?

Cycles in family tree software

When I use `show()` to plot the graphs in `X`, the graphs looks very good. However when I start to use `savefig()` to generate large amount of graphs, the `savefig()` generated graphs
&#39; font, lines, polygons all look smaller than the `show()` generated graph. My environment is Ubuntu and the backend for `show()` is `Qt4Agg`. How can I make the `show()` plot and the `savefig()` plot looks consistent?

matplotlib savefig() plots different from show()

I&#39;m interested in network analysis on large networks with millions of nodes and tens of millions of edges.  I want to be able to do things like parse networks from many formats, find connected components, detect communities, and run centrality measures like PageRank.

I am attracted to NetworkX because it has a nice api, good documentation, and has been under active development for years.  Plus because it is in python, it should be quick to develop with.

In a recent presentation (the slides are available on github [here][1]), it was claimed that:

&gt; Unlike many other tools, NX is designed to handle data on a scale
relevant to modern problems...Most of the core algorithms in NX rely on extremely fast legacy code.

The presentation also states that the base algorithms of NetworkX are implemented in C/Fortran.

However, looking at the source code, it looks like NetworkX is mostly written in python.  I am not too familiar with the source code, but I am aware of a couple of examples where NetworkX uses numpy to do heavy lifting (which in turn uses C/Fortran to do linear algebra).  For example, the file `networkx/networkx/algorithms/centrality/eigenvector.py` uses numpy to calculate eigenvectors.

Does anyone know if this strategy of calling an optimized library like numpy is really prevalent throughout NetworkX, or if just a few algorithms do it?  Also can anyone describe other scalability issues associated with NetworkX?

**Reply from NetworkX Lead Programmer**
I posed this question on the NetworkX mailing list, and Aric Hagberg replied:

&gt; The data structures used in NetworkX are appropriate for scaling to
&gt; large problems (e.g. the data structure is an adjacency list).  The
&gt; algorithms have various scaling properties but some of the ones you
&gt; mention are usable  (e.g. PageRank,  connected components, are linear
&gt; complexity in the number of edges).
&gt; 
&gt; At this point NetworkX is pure Python code.  The adjacency structure
&gt; is encoded with Python dictionaries which provides great flexibility
&gt; at the expense of memory and computational speed.  Large graphs will
&gt; take a lot of memory and you will eventually run out.
&gt; 
&gt; NetworkX does use NumPy and SciPy for algorithms that are primarily
&gt; based on linear algebra.  In that case the graph is represented
&gt; (copied) as an adjacency matrix using either NumPy matrices or SciPy
&gt; sparse matrices.  Those algorithms can benefit from the legacy C and
&gt; FORTRAN code that is used under the hood in NumPy and SciPY.

  [1]: https://github.com/drewconway/NetworkX_Intro_Materials

What scalability issues are associated with NetworkX?

How do you trace the path of a Breadth-First Search, such that in the following example:

![](https://upload.wikimedia.org/wikipedia/commons/thumb/3/33/Breadth-first-tree.svg/300px-Breadth-first-tree.svg.png)

If searching for key `11`, return the **shortest** list connecting 1 to 11.

    [1, 4, 7, 11]

How to trace the path in a Breadth-First Search?

I have written a recursive DFS algorithm to traverse a graph:

    void Graph&lt;E, N&gt;::DFS(Node n)
    {
	    std::cout &lt;&lt; ReadNode(n) &lt;&lt; &quot; &quot;;

	    MarkVisited(n);

	    NodeList adjnodes = Adjacent(n);

	    NodeList::position pos = adjnodes.FirstPosition();

	    while(!adjnodes.End(pos))
	    {
		    Node adj = adjnodes.ReadList(pos);

		    if(!IsMarked(adj))
		    	DFS(adj);

		    pos = adjnodes.NextPosition(pos);
	    }
    }

Then I have written an iterative DFS algorithm using a stack:

    template &lt;typename E, typename N&gt;
    void Graph&lt;E, N&gt;::IterativeDFS(Node n)
    {
        Stack&lt;Node&gt; stack;

        stack.Push(n);

    	while(!stack.IsEmpty())
    	{
	    	Node u = stack.Read();

	    	stack.Pop();

	    	if(!IsMarked(u))
	    	{
		    	std::cout &lt;&lt; ReadNode(u) &lt;&lt; &quot; &quot;;

		    	MarkVisited(u);

		    	NodeList adjnodes = Adjacent(u);

		    	NodeList::position pos = adjnodes.FirstPosition();

			    while(!adjnodes.End(pos))
			    {
			    	stack.Push(adjnodes.ReadList(pos));

			    	pos = adjnodes.NextPosition(pos);
			    }
		    }
	    }

My problem is that in a graph in which, for example, I enter the three nodes &#39;a&#39;, &#39;b&#39;, &#39;c&#39; with arcs (&#39;a&#39;, &#39;b&#39;) and (&#39;a&#39;, &#39;c&#39;) my output is:

&#39;a&#39;, &#39;b&#39;, &#39;c&#39; with the recursive DFS version, and:

&#39;a&#39;, &#39;c&#39;, &#39;b&#39; with the iterative DFS one.

How could I get the same order? Am I doing something wrong?

Thank you!


Iterative DFS vs Recursive DFS and different elements order

I&#39;m currently using Matplotlib to create a histogram:

![enter image description here][1]

    import matplotlib
    matplotlib.use(&#39;Agg&#39;)
    import matplotlib.pyplot as pyplot
    ...
    fig = pyplot.figure()
    ax = fig.add_subplot(1,1,1,)
    n, bins, patches = ax.hist(measurements, bins=50, range=(graph_minimum, graph_maximum), histtype=&#39;bar&#39;)

    #ax.set_xticklabels([n], rotation=&#39;vertical&#39;)

    for patch in patches:
        patch.set_facecolor(&#39;r&#39;)

    pyplot.title(&#39;Spam and Ham&#39;)
    pyplot.xlabel(&#39;Time (in seconds)&#39;)
    pyplot.ylabel(&#39;Bits of Ham&#39;)
    pyplot.savefig(output_filename)


I&#39;d like to make the x-axis labels a bit more meaningful.

Firstly, the x-axis ticks here seem to be limited to five ticks. No matter what I do, I can&#39;t seem to change this - even if I add more xticklabels, it only uses the first five. I&#39;m not sure how Matplotlib calculates this, but I assume it&#39;s auto-calculated from the range/data?

**Is there some way I can increase the resolution of x-tick labels** - even to the point of one for each bar/bin?

(Ideally, I&#39;d also like the seconds to be reformatted in micro-seconds/milli-seconds, but that&#39;s a question for another day).

Secondly, I&#39;d like **each individual bar labeled** - with the actual number in that bin, as well as the percentage of the total of all bins.

The final output might look something like this:

![enter image description here][2]

Is something like that possible with Matplotlib?

Cheers,
Victor


  [1]: http://i.stack.imgur.com/B0jJr.png
  [2]: http://i.stack.imgur.com/UyBGD.png

Matplotlib - label each bin

I want to plot trees using Python. Decision trees, Organizational charts, etc. Any library that helps me with that?

Tree plotting in Python

I&#39;m an R/ggplot newbie. I would like to create a geom_line plot of a continuous variable time series and then add a layer composed of events. The continuous variable and its timestamps is stored in one data.frame, the events and their timestamps are stored in another data.frame. 

What I would _really_ like to do is something like the charts on finance.google.com. In those, the time series is stock-price and there are &quot;flags&quot; to indicate news-events. I&#39;m not actually plotting finance stuff, but the type of graph is similar. I am trying to plot visualizations of log file data. Here&#39;s an example of what I mean...

![google chart with events][1]

If advisable (?), I would like to use separate data.frames for each layer (one for continuous variable observations, another for events).

After some trial and error this is about as close as I can get. Here, I am using example data from data sets that come with ggplot. &quot;economics&quot; contains some time-series data that I&#39;d like to plot and &quot;presidential&quot; contains a few events (presidential elections).
    
    library(ggplot2)
    data(presidential)
    data(economics)

    presidential &lt;- presidential[-(1:3),]
    yrng &lt;- range(economics$unemploy)
    ymin &lt;- yrng[1]
    ymax &lt;- yrng[1] + 0.1*(yrng[2]-yrng[1])
    
    p2 &lt;- ggplot()
    p2 &lt;- p2 + geom_line(mapping=aes(x=date, y=unemploy), data=economics , size=3, alpha=0.5) 
    p2 &lt;- p2 + scale_x_date(&quot;time&quot;) +  scale_y_continuous(name=&quot;unemployed [1000&#39;s]&quot;)
    p2 &lt;- p2 + geom_segment(mapping=aes(x=start,y=ymin, xend=start, yend=ymax, colour=name), data=presidential, size=2, alpha=0.5)
    p2 &lt;- p2 + geom_point(mapping=aes(x=start,y=ymax, colour=name ), data=presidential, size=3) 
    p2 &lt;- p2 + geom_text(mapping=aes(x=start, y=ymax, label=name, angle=20, hjust=-0.1, vjust=0.1),size=6, data=presidential)
    p2

![my attempt][2]


Questions: 

 * This is OK for very sparse events, but if there&#39;s a cluster of them (as often happens in a log file), it gets messy. Is there some technique I can use to neatly display a bunch of events occurring in a short time interval? I was thinking of position_jitter, but it was really hard for me to get this far. google charts stacks these event &quot;flags&quot; on top of each other if there&#39;s a lot of them.

 * I actually don&#39;t like sticking the event data in the same scale as the continuous measurement display. I would prefer to put it in a facet_grid. The problem is that the facets all must be sourced from the same data.frame (not sure if that&#39;s true). If so, that also seems not ideal (or maybe I&#39;m just trying to avoid using reshape?)



  [1]: http://i.stack.imgur.com/R4OWP.png
  [2]: http://i.stack.imgur.com/h6Sml.png

R + ggplot : Time series with events

I&#39;m looking for a free Java library to visualize some data. I want to do something similar as the following two images. Is there any possibility? I first thought of prefuse, but this isn&#39;t developed since 2007. So any oher libraries?

![enter image description here][1]

![enter image description here][2]


  [1]: http://i.stack.imgur.com/VyhUr.png
  [2]: http://i.stack.imgur.com/MmJ8l.jpg

Free java data visualization library?

I am trying to visualize my data flow with a Sankey Diagram in R.

I found [this blog post](http://biologicalposteriors.blogspot.com/2010/07/sankey-diagrams-in-r.html) linking to an R script that produces a Sankey Diagram; unfortunately, it&#39;s quite raw and somewhat limited (see below for sample code and data).

Does anyone know of other scripts—or maybe even a package—that is more developed? My end goal is to visualize both data flow and percentages by relative size of diagram components, like in [these  examples of Sankey Diagrams](http://www.sankey-diagrams.com/tag/software/). 

I posted [a somewhat similar question on the r-help list](http://tolstoy.newcastle.edu.au/R/e17/help/12/03/7682.html), but after two weeks without any responses I&#39;m trying my luck here on stackoverflow.

Thanks,
Eric

PS. I&#39;m aware of the [Parallel Sets Plot](https://stats.stackexchange.com/questions/12029/is-it-possible-to-create-parallel-sets-plot-using-r), but that is not what I&#39;m looking for.

    # thanks to, https://tonybreyal.wordpress.com/2011/11/24/source_https-sourcing-an-r-script-from-github/
      sourc.https     &lt;- function(url, ...) {
    # install and load the RCurl package 
    if (match(&#39;RCurl&#39;, nomatch=0, installed.packages()[,1])==0) {
      install.packages(c(&quot;RCurl&quot;), dependencies = TRUE)
      require(RCurl)  
    } else require(RCurl)    

    # parse and evaluate each .R script
      sapply(c(url, ...), function(u) {
        eval(parse(text = getURL(u, followlocation = TRUE, 
        cainfo  = system.file(&quot;CurlSSL&quot;, &quot;cacert.pem&quot;, 
        package = &quot;RCurl&quot;))), envir = .GlobalEnv)
     } )
     }
    
    # from https://gist.github.com/1423501
    sourc.https(&quot;https://raw.github.com/gist/1423501/55b3c6f11e4918cb6264492528b1ad01c429e581/Sankey.R&quot;)
    
    # My example (there is another example inside Sankey.R):
    inputs = c(6, 144)
    losses = c(6,47,14,7, 7, 35, 34)
    unit = &quot;n =&quot;
    
    labels = c(&quot;Transfers&quot;,
               &quot;Referrals\n&quot;,
               &quot;Unable to Engage&quot;,
               &quot;Consultation only&quot;,
               &quot;Did not complete the intake&quot;,
               &quot;Did not engage in Treatment&quot;,
               &quot;Discontinued Mid-Treatment&quot;,
               &quot;Completed Treatment&quot;,
               &quot;Active in \nTreatment&quot;)
    
    SankeyR(inputs,losses,unit,labels)
    
    # Clean up my mess
    rm(&quot;inputs&quot;, &quot;labels&quot;, &quot;losses&quot;, &quot;SankeyR&quot;, &quot;sourc.https&quot;, &quot;unit&quot;)

Sankey Diagram produced with the above code, ![Sankey Diagram produced with the code above][1]

  [1]: http://i.stack.imgur.com/9jiMq.png

Content Type	Original Author	Original Content on Stackoverflow
Question	Iustin	View Question on Stackoverflow
Solution 1 - Java	evilone	View Answer on Stackoverflow
Solution 2 - Java	Oubenal Mohcine	View Answer on Stackoverflow
Solution 3 - Java	Andreas Petersson	View Answer on Stackoverflow
Solution 4 - Java	Tommy O'Dell	View Answer on Stackoverflow
Solution 5 - Java	Prashant Bhate	View Answer on Stackoverflow
Solution 6 - Java	Macilias	View Answer on Stackoverflow

Java graph library for dynamic visualisation

Java Problem Overview

Java Solutions

Solution 1 - Java

Solution 2 - Java

Solution 3 - Java

Solution 4 - Java

Solution 5 - Java

Solution 6 - Java

Console app arguments, how arguments are passed to Main method

Why was pair range access removed from C++11?

Attributions