Displaying 1 to 10 from 10 results

A javascript library for laying out area proportional venn and euler diagrams. Details of how this library works can be found on the blog post I wrote about this. A follow up post discusses testing strategy and algorithmic improvements.

venn-diagram d3 euler-diagram venn eulerREAVIZ is a modular chart component library that leverages React natively for rendering the components while using D3js under the hood for calculations. The library provides an easy way to get started creating charts without sacrificing customization ability. If you are looking for node-based graphs, checkout reaflow.

react d3 chart charts euler reactjs heatmap data-visualization venn-diagram data-viz sparkline scatter-plot d3js bubble-chart line-charts bar-charts area-charts hive-plot sankey-chart d3.js dataviz charting svg bar-chart axis brush area-chart line-chart pie-chart sankey pan zoom radial calendar-heatmap legends vennIntegrate a system of ODEs using the Euler method

scijs ode euler integration differential-equations calculus first-orderMy solutions to many of the programming (Computer Science) problems on several online judges, including UVa, ACM/ICPC, TopCoder, Codeforces, URI, SPOJ and SPOJ Brasil. Preferably my solutions are written in C++. Whenever I find myself unable to solve some problem in plain C++, I switch to Java.

spoj euler uva icpc competition topcoder competitive-programmingA number theory toolkit for JavaScript. Determines all of the divisors for a given number.

number theory euler mathWant one that's not there? Open an issue, or better yet, a pull request adding it. All of the methods are hand-written in asm.js, so they should be fast. Not that your integration method would ever be your bottleneck anyway, but hey... why not.

numerical integrate integration rk4 runge kutta euler physics ode ordinary differential equationConnectivity queries can be answered in O(log(size of component)), and updates take O(log(number of vertices)^2) time. The total space complexity is O((number of edges + number of vertices) * log(number of vertices)). This code works both in node.js and in the browser using browserify.

dynamic graph connected component forest label spanning tree insert delete remove link cut edge euler vertex pathThese are Shlomi Fish’s solutions to the Project Euler’s problems which are a set of mathematical problems that may be solved by writing computer programs. Note that some of these solutions were copied from elsewhere on the Internet. The licences of the contents of this repository varies, but most of the original content is available under the MIT/Expat License.

euler math maths riddles projecteuler project-euler projecteuler-solutionsThese repository is a collection of useful algorithms and data structures built in MATLAB/Octave. In addition you will find solutions from project euler problem sets. The code in this repository is cross-portabel for MATLAB and for Octave. Octave is a free high-level interpreter language that is equivalent to the textuelle programming language MATLAB.

matlab octave octave-scripts algorithms datastructures project euler m-scripts m-script mit-license project-euler algorithmProject Euler solutions in different programming languages. Check our CONTRIBUTING.md for guidelines.

project-euler euler-solutions elixir crystal haskell dlang euler programming-language typescript
We have large collection of open source products. Follow the tags from
Tag Cloud >>

Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
**Add Projects.**