LEDA GRAPHS HOME 
Supported Platforms
Maintenance & Support
Prices & Order

 

Schuetzenstrasse 3-5
66123 Saarbruecken
Germany

Phone: +49 (0)681 3710612
Fax: +49 (0)681 77012646

contact@algorithmic-solutions.com
http://www.algorithmic-solutions.com


HOME » LEDA GRAPHS HOME

.......................................................................................................

LEDA Graphs for Java

.......................................................................................................

About LEDA Graphs for Java: 

LEDA Graphs for Java is a software library containing collections of Java classes and functions providing efficient data types and graph algorithms that are easily usable within your Java development projects.

More precisely, LEDA Graphs provides most of the LEDA Library's functionality as listed in the Graph Algorithms chapter of the LEDA manual. LEDA Graphs' Java classes and functions provide direct access to the corresponding LEDA C++ data types and algorithms via Java Native Interface and a C++ dynamic link library. The interface was created using the interface generator SWIG.

The package comes with a set of examples. The syntax in Java correlates to that in C++/LEDA. The Java data types and algorithms wrap the remotely available C++ objects; no copying of data and/or objects is required.

Currently, the package comes with MS Windows DLL but will soon be available for Linux as well. Similar interfaces for using LEDA with other languages such as Python, PHP or Javascript are in the making.

LEDA Graphs - Available Algorithms:

LEDA Graphs for Java provides basic graph algorithms for reachability problems, shortest path algorithms, matching algorithms, flow algorithms, and many more.

For a list of all algorithms contained in the LEDA Graphs package  please consult the Graph Algorithms chapter of the LEDA manual; All algorithms listed there - except for Graph Drawing Algorithms, Graph Morphism Algorithms and Graph Morphism Algorithm Functionality - are available through LEDA Graphs. That means all algorithms mentioned in the subchapters from Basic Graph Algorithms to Algorithms for Planar Graphs can be used with Java.

Site Development License:

The Site Development License is valid for one authorized site. The authorized site must be a specific place of business of Licensee that is defined by a physical address.The Site Development License allows Licensee the right to install and use the Software on an arbitrary number of machines operated by the Licensee at his authorized site. A Site Development  License grants Licensee the right to share or use the Software concurrently by multiple individual developers at the authorized site.

Licensee may not sell, rent, loan or otherwise encumber or transfer the Software in whole or in part, to a third party. Licensee is explicitly prohibited from distributing the Software, in whole or in part, to any third party, except as expressively granted by the license.

More Information ....
For more information about the LEDA Graphs Site Development License,  please visit LEDA Graphs License Terms.

IMPRESSUM | PRIVACY & TERMS OF USE | WEB CONTACT
Google
 
Copyright © 2017 Algorithmic Solutions Software GmbH. All rights reserved