Open Source Windows Algorithms - Page 47

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

A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.

Dictionary-tree is a standard dictionary, means a lexicographic tree (acyclic graph), where letters are nodes of tree, starting from root going down to leaves. You can Get and Add words, Clear and Save the whole dictionary. C++ and Pascal.

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").

natural sort / order of arrays, sorts integer, string and mixed arrays - also strings with numbers included will be ordered naturaly, natsort and natcasesort for javascript

javascript-algorithms is a repository that implements a comprehensive collection of classic data structures and algorithmic solutions in JavaScript — including sorting, searching, graph algorithms, dynamic programming, and more. It serves as a learning and reference resource for developers wanting to understand how standard algorithms can be expressed in JavaScript, bridging the gap between theoretical algorithm knowledge and practical implementation usable in web or Node.js contexts. Because algorithms are implemented in a language (JavaScript) many developers use daily, the repo becomes especially useful for students, interview-preparation candidates, or anyone wanting to learn algorithmic thinking without switching languages. The code tends to be readable, structured, and adapted to JavaScript idioms, making it easier to follow for JS developers.

Algorithms and data structures implemented in JavaScript with explanations and links to further readings

This project is a reasoner for the description logic EL+. It computes the concept subsumption hierarchy. It is an OWL 2 EL reasoner.

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/

jpaul is a Java implementation of several algorithms widely used in program analysis. It emphasizes flexibility and ease-of-use and is independent of any specific compiler infrastructure project. BSD Licence.

jr239co620

jsGorithm is a Javascript algorithm execution viewer that can be used as an educative tool for introductory courses on programming and algorithmics, with programs written in a subset of C/C++/Javascript. It can be used for teaching and learning.

The judyhash project provides C++ STL-style maps and sets based on unique algorithms and having unique characteristics.

Class : KConvert for convert character sets between ascii code and unicode.

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

A simple program that solves linear equation systems. As of now only numerical coefficients are supported. The program is very simple and not suited for big matrices, since it uses laplace's method.

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

ktsolver - Knight's Tour problem solver. Finds quickly a lot of solutions of the Knight's Tours problem.

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.

A simple library to generate pseudo unique long (int64) identifiers. Collisions are expected, they are usually under 0.20%.

libObfuscate 2.00 ISO C / open-source / system independent * Modern 256bit cryptography: AES, Anubis, Camellia, Cast-256, Clefia, FROG, Hierocrypt3, Idea-NXT, MARS, RC6, Safer+, SC2000, Serpent, Speed, Twofish, Unicorn-A, Wrapper * CSPRNG (based on AES) * Modern 512bit hashing: Grostl, Keccak, SHA2, Skein, Wrapper * Scrambling * Multi-layered obfuscation

libPPP is an advanced image compression library. Depending on the content of the image, it uses either PGF (Progressive Graphics File) or PNG (Portable Network Graphics) to compress the image.