Open Hub
Black Duck Open Hub

Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

Sort-Naturally-XS

Compare

  Analyzed about 14 hours ago

Sort::Naturally::XS - Perl extension for human-friendly ("natural") sort order. Natural sort order is an ordering of mixed strings (consist of characters and digits) in alphabetical order, except that digital parts are ordered as numbers. Natural sorting can be considered as a replacement of a ... [More] standard machine-oriented alphabetical sorting, because it is more convenient for human understanding. [Less]

3.87K lines of code

0 current contributors

almost 6 years since last commit

1 users on Open Hub

Inactive
0.0
 
0 Reviews
I Use This
Mostly written in C++
Licenses: gpl3
Tags algorithm natural-sort natural_sort perl perl5 perl-module perl_module perlxs sort

Sort-Naturally-ICU

Compare

  Analyzed about 6 hours ago

Sort::Naturally::ICU - Perl extension for human-friendly ("natural") sort order, which using ICU library for locale aware sorting. Natural sort order is an ordering of mixed strings (consist of characters and digits) in alphabetical order, except that digital parts are ordered as numbers. Natural ... [More] sorting can be considered as a replacement of a standard machine-oriented alphabetical sorting, because it is more convenient for human understanding. The problem is that not all Unix-like OSs completely support POSIX, in fact only Linux fully POSIX compatible. Therefore you can't use above approach in Mac OS or FreeBSD. This module is designed to solve this issue. [Less]

3.92K lines of code

0 current contributors

over 6 years since last commit

1 users on Open Hub

Inactive
0.0
 
0 Reviews
I Use This
Mostly written in C++
Licenses: gpl3
Tags algorithm icu natural-sort natural_sort perl perl5 perl-module perl_module perlxs sort

adapters-shortest-paths

Compare

  Analyzed about 22 hours ago

Adapters for Java implementations of algorithms for routing the shortest paths between two vertices/nodes/points in a directed weighted graph without multiple edges between the same two vertices. The resulting paths must not have any loops/cycles i.e. must not visit the same vertex more than once ... [More] within the same path. The resulting paths do not have to be disjoint. Neither edge-disjoint nor vertex-disjoint. In other words it is okay that the same edge or vertex exist in different paths. The license for the core project is MIT but the adapee/adapter libraries licensed in the same way as the corresponding original Java code i.e. Apache 2.0 license. [Less]

38.8K lines of code

1 current contributors

about 2 years since last commit

1 users on Open Hub

Inactive
0.0
 
0 Reviews
I Use This
Mostly written in Java
Licenses: apache_2, mit
Tags algorithm Java kShortestPaths routing shortestpaths Yen

CheeseBurger

Compare

  Analyzed 1 day ago

CheeseBurger Machine Learning Library (Python)

350 lines of code

1 current contributors

over 5 years since last commit

1 users on Open Hub

Inactive
5.0
 
0 Reviews
I Use This
Mostly written in Python
Licenses: No declared licenses
Tags algorithm machine-learning machinelearning

NITSkmOS/algo

Compare

  Analyzed about 20 hours ago

In case you want to contribute, ping on https://gitter.im/NITSkmOS/algo.

2.77K lines of code

13 current contributors

over 3 years since last commit

1 users on Open Hub

Inactive
0.0
 
0 Reviews
I Use This
Mostly written in C++
Licenses: mit
Tags algo algorithm algorithms datastructure datastructures python sorting sortingalgorithm

RRT-Visualization

Compare

  Analyzed about 14 hours ago

This project visualizes the exploration of a cubic search space by a single RRT. You can see how the search tree grows starting in the middle of the cube. Parameters can be adjusted while the planning algorithm is executing. Visit https://mkroehnert.gitlab.io/RRT-Visualization/ in order to see the demo.

27.1K lines of code

0 current contributors

almost 6 years since last commit

1 users on Open Hub

Inactive
0.0
 
0 Reviews
I Use This
Mostly written in JavaScript
Licenses: mit
Tags 3d algorithm javascript motionplanning pathplanning rrt threejs visualization

SourceCred

Compare

  Analyzed about 16 hours ago

A social algorithm for computing cred

325K lines of code

0 current contributors

about 1 year since last commit

1 users on Open Hub

Very Low Activity
0.0
 
0 Reviews
I Use This
Mostly written in JavaScript
Licenses: No declared licenses
Tags algorithm computing Cred social source Source sourcecred SourceCred

CXXGraph

Compare

  Analyzed about 9 hours ago

Header-Only C++ Library for Graph Representation and Algorithms

16K lines of code

0 current contributors

3 days since last commit

1 users on Open Hub

Moderate Activity
5.0
 
0 Reviews
I Use This
Mostly written in C++
Licenses: AGPL3
Tags algorithm algorithms bfs c++ c++17 cpp c++templates cyclesdetection dfs djikstra graph graph-algorithms 6 more...

minfx

Compare

  Analyzed about 17 hours ago

The minfx project is a Python package for numerical optimisation, being a large collection of standard minimisation algorithms. This includes the line search methods: steepest descent, back-and-forth coordinate descent, quasi-Newton BFGS, Newton, Newton-CG; the trust-region methods: Cauchy ... [More] point, dogleg, CG-Steihaug, exact trust region; the conjugate gradient methods: Fletcher-Reeves, Polak-Ribiere, Polak-Ribiere +, Hestenes-Stiefel; the miscellaneous methods: Grid search, Simplex, Levenberg-Marquardt; and the augmented function constraint algorithms: logarithmic barrier and method of multipliers (or augmented Lagrangian method). [Less]

3.77K lines of code

0 current contributors

over 8 years since last commit

1 users on Open Hub

Inactive
5.0
 
0 Reviews
I Use This
Mostly written in Python
Licenses: gpl3_or_l...
Tags algorithm conjugate_gradient library line_search local_optimisation minimisation minimization nonlinear numerical optimisation optimization python 1 more...

interval-tree

Compare

  Analyzed about 4 hours ago

A Ruby implementation of augmented interval tree

477 lines of code

0 current contributors

about 3 years since last commit

1 users on Open Hub

Inactive
0.0
 
0 Reviews
I Use This
Mostly written in Ruby
Licenses: mit
Tags algorithm interval ruby tree