Open Source Java Algorithms - Page 18

Application to automatically merge gedcom files. It provides either a user or another program the ability to merge gedcom files with as little human interaction as possible and with high quality of matching results.

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

** MOVED: to github.com/gundermanc/gundercrypt A CLI text ciphering program and library written in java that makes use of pseudo random numbers and a password (provided by the user) to generate encrypted text by selectively shifting each subsequent letter by a pseudo-random index, encoding it as a letter stored in a hidden position within the String, and then re shifting the encrypted String again by numeric values deduced from a password to provide a dual layer of security. Easily can be imported into any java project or run via shell commands.

hello-algorithm is an educational repository designed to teach data structures and algorithms through clear explanations, visualizations, and code examples. It provides a structured learning path that covers fundamental concepts such as arrays, linked lists, trees, graphs, sorting algorithms, and dynamic programming. The project emphasizes understanding over memorization by breaking down complex topics into intuitive explanations supported by diagrams and examples. It is accessible to learners at different levels, from beginners to more advanced users who want to reinforce their knowledge. The repository often includes multilingual support, making it accessible to a broader audience. It also focuses on practical application, helping users understand how algorithms are used in real-world scenarios.

iGesture is a Java-based gesture recognition framework providing access to multiple gesture recognition algorithms and different input devices. The iGesture Workbench supports the definition and evaluation of customised gesture sets and algorithms.

Connection pool: manage SQL in file, Strong (auto recover/detect connection) Data persistence: Store/fetch java object from/to DB/XML/PureText. configable XML: extend W3C DOM Programming: extend java, (multi-line properties etc.)

An information extraction library implementing modern algorithms for the extraction of named entities from text.

jCrosstab is an API to convert JDBC ResultSet objects to a set of arrays that translate the data from Tabular (or MultiTabular) to CrossTab or Multi-Crosstab. The idea is similar to an Excel Pivot Table, but more powerful.

Simple genetic programming framework. Features a robust set of interfaces and standard implementations for rapid development and ease of experimentation.

jMathematics is a Java based mathematics framework and library. It solves numerical and symbolic calculations. It is designed to be integrated in a wide range of other applications.

jMetal is an object-oriented Java-based framework for solving multi-objective optimization problems with metaheuristics.

jPasswordWallet strores your passwords in security. Find, modify or create quickly a password in the database. Organize your passwords as you like with creating categories and sub categories.

jStates is a java library for easy state machine design and implementation.It uses XML to define states and state transitions. jStates is aimed at easy integration with desktop J2SE applications, Struts, Commons Validator, Web and other J2EE technologies

Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity. A library implementing different string similarity and distance measures. A dozen of algorithms (including Levenshtein edit distance and sibblings, Jaro-Winkler, Longest Common Subsequence, cosine similarity etc.) are currently implemented. The main characteristics of each implemented algorithm are presented below. The "cost" column gives an estimation of the computational cost to compute the similarity between two strings of length m and n respectively. If the alphabet is finite, it is possible to use the method of four russians (Arlazarov et al. "On economic construction of the transitive closure of a directed graph", 1970) to speedup computation. This was published by Masek in 1980 ("A Faster Algorithm Computing String Edit Distances").

A simple java library for text and object oriented code. Among the different available packages, there are for text analysis (levenshtein and ngram fingerprinting), a grammar framework, simple object persistence (very light and dependence free), ...

Java library for operations with Iterables and other data structures in functional way.

JMathStudio is a Java based digital image and signal processing toolkit/library. It is simple to use, portable, light (~300 Kb), extendable and free. Full source code available at https://github.com/bhavyaajani/jmathstudio Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/

jr239co620

jsprit is a java based, open-source toolkit for solving rich Traveling Salesman Problems(TSP) and Vehicle Routing Problems(VRP). It is lightweight, flexible and easy-to-use, and based on a single all-purpose meta-heuristic. Setting up the problem, defining additional constraints, modifying the algorithms and visualizing the discovered solutions is as easy and handy as reading classical VRP instances to benchmark your algorithm. It is fit for change and extension due to its modular design and a comprehensive set of unit and integration tests. Possibility to define additional stateless and stateful constraints/conditions to account for the richness of your problem. GraphHopper invests in an active open source community. Our flagships are the GraphHopper routing engine and jsprit, the toolkit for solving rich vehicle routing problems. We promote a fair & diverse mindset.

This project has be renamed to jnum and moved under the crush-software project. No further SVN commits here...

This project has moved to github at http://lmwtree.devries.ninja.

LDIFF is an enhanced language-independent line differencing tool built upon the Unix diff and overcomes its limitations in determining whether an artifact line has been changed or is the result of additions and removals

Do Leetcode exercises in IDE, support leetcode.com and leetcode-cn.com, to meet the basic needs of doing exercises.Support theoretically: IntelliJ IDEA PhpStorm WebStorm PyCharm RubyMine AppCode CLion GoLand DataGrip Rider MPS Android Studio. The login accounts of the two websites are not interoperable and the corresponding users need to be configured when switching websites. You can also refresh and load questions if you are not logged in, but you cannot submit it. Input the content and press Enter to search , press again to search for the next one. It can only search under the question bank node. Clean up the files in the configured cache directories. The cache directories of the two websites are different and only the current configured websites are cleaned up. Carefully clean up cases without submitting.

Locality Sensitive Hashing is an improved indexing method for high dimensional data. lshtools provides indexing with LSH and an intelligent non supervised subsampling strategy using this indexing method.

neochip is a collection of algorithms for high-density oligonucleotide microarrays. The current version contains heuristic algorithms that attempt to improve the quality of arrays by re-designing their layout (the location of the probes on the chip).