background preloader

JUNG - Java Universal Network/Graph Framework

JUNG - Java Universal Network/Graph Framework
Java Universal Network/Graph Framework JUNG — the Java Universal Network/Graph Framework--is a software library that provides a common and extendible 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 hypergraphs. 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.

Related:  Graph theory, graph practice

Metaprogramming Metaprogramming usually works in one of three ways[citation needed]. The first way is to expose the internals of the run-time engine to the programming code through application programming interfaces (APIs). The second approach is dynamic execution of expressions that contain programming commands, often composed from strings, but can also be from other methods using arguments and/or context.[1] Thus, "programs can write programs." Although both approaches can be used in the same language, most languages tend to lean toward one or the other. The third way is to step outside the language entirely. untitled A simple particle system physics engine for processing. I've designed this to be application / domain agnostic. All this is supposed to do is let you make particles, apply forces and calculate the positions of particles over time in real-time. Anything else you need to handle yourself. There are four parts ParticleSystem - takes care of gravity, drag, making particles, applying forces and advancing the simulation Particles - they move around in 3D space based on forces you've applied to them Springs - they act on two particles Attractions - which also act on two particles

IsaViz Overview News IsaViz and Java 1.6 (2007-10-21) IsaViz 2.x is not compatible with Java 1.6 or later. Home - GitHub Pipes is a dataflow framework using process graphs. A process graph is composed of Pipe vertices connected by communication edges. A Pipe implements a simple computational step that can be composed with other Pipe objects to create a larger computation. Such data flow graphs allow for the splitting, merging, looping, and in general, the transformation of data from input to output. Map your moves Data This map distills more than 4000 moves from over 1700 people, collected in an informal survey by WNYC, a New York based public radio station. For generating the geo–coordinates from the entered ZIP codes, I used the free bulk geocoder at I did not check every single data row in detail, so a few of the moves might be misrepresented.

Is the Tipping Point Toast? Don't get Duncan Watts started on the Hush Puppies. "Oh, God," he groans when the subject comes up. "Not them." Social network analysis software Social network analysis software (SNA software) is software which facilitates quantitative or qualitative analysis of social networks, by describing features of a network either through numerical or visual representation. Overview[edit] Some SNA software can perform predictive analysis.[5] This includes using network phenomena such as a tie to predict individual level outcomes (often called peer influence or contagion modeling), using individual-level phenomena to predict network outcomes such as the formation of a tie/edge (often called homophily models[6]) or particular type of triad, or using network phenomena to predict other network phenomena, such as using a triad formation at time 0 to predict tie formation at time 1. Network analysis software generally consists of either packages based on graphical user interfaces (GUIs), or packages built for scripting/programming languages.

Glossary of graph theory Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. Hamiltonian path This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. Hamiltonian paths and cycles and cycle paths are named after William Rowan Hamilton who invented the icosian game, now also known as Hamilton's puzzle, which involves finding a Hamiltonian cycle in the edge graph of the dodecahedron. Hamilton solved this problem using the icosian calculus, an algebraic structure based on roots of unity with many similarities to the quaternions (also invented by Hamilton).

Related:  libraryCarrera