Lesson plan
JUNG
of the Russian Wiktionary by the Dijkstra's algorithm. A shortest path computation on a graph was implemented within the JUNG. JUNG (the Java Universal Network/Graph Framework) is an open-source graph modeling and visualization framework written in Java, under the BSD license. The framework comes with a number of layout algorithms built in, as well as analysis algorithms such as graph clustering and metrics for node centrality. JUNG's architecture is designed to support a variety of representations of entities and their relations, such as directed and undirected graphs, , graphs with parallel edges, and hypergraphs. It provides a mechanism for annotating graphs, entities, and relations with metadata. JUNG also 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. JUNG includes implementations of a number of algorithms from graph theory, data mining, and social network analysis, such as routines for clustering, , , random graph generation, statistical analysis, and calculation of network distances, flows, and importance measures. JUNG provides a visualization framework that makes it easy to construct tools for the interactive exploration of network data.…
Article summary
of the Russian Wiktionary by the Dijkstra's algorithm. A shortest path computation on a graph was implemented within the JUNG. JUNG (the Java Universal Network/Graph Framework) is an open-source graph modeling and visualization framework written in Java, under the BSD license. The framework comes with a number of layout algorithms built in, as well as analysis algorithms such as graph clustering and metrics for node centrality. JUNG's architecture is designed to support a variety of representations of entities and their relations, such as directed and undirected graphs, , graphs with parallel edges, and hypergraphs. It provides a mechanism for annotating graphs, entities, and relations with metadata. JUNG also 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. JUNG includes implementations of a number of algorithms from graph theory, data mining, and social network analysis, such as routines for clustering, , , random graph generation, statistical analysis, and calculation of network distances, flows, and importance measures. JUNG provides a visualization framework that makes it easy to construct tools for the interactive exploration of network data.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.