Download JAR files tagged by variety with all dependencies
jung-parent from group io.github.devlibx.jung (version 3.1)
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 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. 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.
Group: io.github.devlibx.jung Artifact: jung-parent
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung-parent
Group io.github.devlibx.jung
Version 3.1
Last update 22. April 2021
Organization not specified
URL http://devlibx.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group io.github.devlibx.jung
Version 3.1
Last update 22. April 2021
Organization not specified
URL http://devlibx.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jung-parent from group com.northdata.jung (version 2.2.0)
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. 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.
Group: com.northdata.jung Artifact: jung-parent
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung-parent
Group com.northdata.jung
Version 2.2.0
Last update 18. September 2020
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.northdata.jung
Version 2.2.0
Last update 18. September 2020
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jung-parent from group net.sf.jung (version 2.1.1)
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. 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.
Group: net.sf.jung Artifact: jung-parent
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung-parent
Group net.sf.jung
Version 2.1.1
Last update 07. September 2016
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.jung
Version 2.1.1
Last update 07. September 2016
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jung2 from group net.sf.jung (version 2.0.1)
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. 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.
Group: net.sf.jung Artifact: jung2
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung2
Group net.sf.jung
Version 2.0.1
Last update 24. January 2010
Organization not specified
URL http://jung.sourceforge.net/site
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.jung
Version 2.0.1
Last update 24. January 2010
Organization not specified
URL http://jung.sourceforge.net/site
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
ironpdf from group com.ironsoftware (version 2024.7.1)
IronPDF Java library offers an extensive compatibility range, making it a go-to solution for a wide array of developers. It fully supports JVM languages like Java, Scala, and Kotlin, making it incredibly versatile. This Java PDF library is also compatible with Java 8 and above, providing optimum performance across multiple platforms. It's been designed with a wide range of users in mind Here's a look at what it supports: JVM Languages: Java, Scala, Kotlin.Platforms: Java 8 and above.Operating Systems: Microsoft Windows, Linux, Docker, Azure, AWS.IDEs: Jetbrains IntelliJ IDEA, Eclipse. You can deploy IronPDF Java across various platforms, including Microsoft Windows, Linux, Docker, Azure, and AWS. It is also fully compatible with popular IDEs like Jetbrains IntelliJ IDEA and Eclipse, facilitating smooth project development and management. Your pom.xml file is essentially the backbone of your project when you're using Maven. It's here where you introduce new dependencies that you wish to include. To make IronPDF Java package a part of your Maven project, you simply need to add the following snippets to your pom.xml: Remember to replace '20xx.xx.xxxx' with the latest version of IronPDF. IronPDF Java simplifies the process of creating PDF files. Convert HTML files, HTML strings, or URLs directly to new PDF documents in a few lines of code. The variety of file formats it handles is vast, as it can even transform images into PDF documents and vice versa. Need to use base 64 encoding, base URLs, or custom file paths? No problem! IronPDF Java has got you coveredFor more detail about installing and using IronPDF Java. When you run your project for the first time post-integration, IronPDF's engine binaries will automatically be downloaded. The engine starts its journey when you call any IronPDF function for the first time and takes a breather when your application is either closed or enters an idle state. It is not an open source java PDF library but here's the best part - IronPDF Java is offering a 30-day free trial. So, why wait? Give it a go and boost your PDF operations today.
0 downloads
Artifact ironpdf
Group com.ironsoftware
Version 2024.7.1
Last update 15. July 2024
Organization Iron Software
URL https://ironpdf.com/java/
License Proprietary License
Dependencies amount 8
Dependencies commons-io, commons-lang3, grpc-netty-shaded, grpc-protobuf, grpc-stub, grpc-protobuf, javax.annotation-api, slf4j-api,
There are maybe transitive dependencies!
Group com.ironsoftware
Version 2024.7.1
Last update 15. July 2024
Organization Iron Software
URL https://ironpdf.com/java/
License Proprietary License
Dependencies amount 8
Dependencies commons-io, commons-lang3, grpc-netty-shaded, grpc-protobuf, grpc-stub, grpc-protobuf, javax.annotation-api, slf4j-api,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 6.4.0)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. Chips-n-Salsa now also includes genetic
algorithms as well as evolutionary algorithms more generally. The
library very extensively supports simulated annealing. It includes
several classes for representing solutions to a variety of optimization
problems. For example, the library includes a BitVector class that
implements vectors of bits, as well as classes for representing
solutions to problems where we are searching for an optimal vector
of integers or reals. For each of the built-in representations, the
library provides the most common mutation operators for generating
random neighbors of candidate solutions, as well as common crossover
operators for use with evolutionary algorithms. Additionally, the
library provides extensive support for permutation optimization
problems, including implementations of many different mutation
operators for permutations, and utilizing the efficiently implemented
Permutation class of the JavaPermutationTools (JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
0 downloads
Artifact chips-n-salsa
Group org.cicirello
Version 6.4.0
Last update 28. July 2023
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!
Group org.cicirello
Version 6.4.0
Last update 28. July 2023
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!
Page 44 from 44 (items total 436)