tiagocavalcante Goto Github PK
Name: Tiago Cavalcante Trindade
Type: User
Bio: Programmer, math lover, and eventually chess player
Location: São Paulo
Name: Tiago Cavalcante Trindade
Type: User
Bio: Programmer, math lover, and eventually chess player
Location: São Paulo
Find a path with a (bad) approximated cost as fast as a Dijkstra
Find a path with a (bad) approximated length as fast as a BFS
A print function created in Assembly and used inside C
2D React audio visualizer using canvas
A calculator made in UWP with C# like the Windows Calculator Standard
A command line calculator made in C
A comment system with backend made in PHP and frontend made in Mithril
A secure, multiple database ORM for PHP
Blazingly-fast compile-time no-std graph crate
An example of how Javascript can run on all devices
This repository contains a CRUD made with Deno, Typescript, tests and env vars
Approximated length search in O(V + E)
A template of a e-book store using PHP
Predict the future state of the population in a epidemic
A equalizer using r3f-equalizer
Automates the extraction of compressed files (which may not have the correct extension) within a folder
An implementation of the Pollard's rho algorithm for factoring semiprime numbers
Fixed cost search on weighted graphs
The fastest algorithm for finding a path with a specific length in a graph
Animation using Manim for a simplified (but not correct) version of FLS
Benchmarks for FLS and Yen algorithm
Number-theoretic conjecture related to primes congruent to 1 modulo 3. It is well known that if p is a prime such that p \equiv 1 \mod 3 and p^k divides a^2 + ab + b^2, then p^{2k+1} divides (a+b)^p - a^p - b^p. However, a conjecture posed by a reader of Kvant magazine suggests that there are no solutions for k > 2
A to do app made with HTML5, SCSS and JavaScript
A server in Golang using fasthttp
A REST API made in Golang using Fasthttp and Fasthttp Router
Represent and manipulate graphs efficiently and easily
Generate infection-trees for big graphs in a few seconds
Rust implementation for computing the number of k-bounded functions from [n] to [n]
Finds the formula for the sum of the kth powers of the first n natural numbers for any positive integer k
Command line tool for filtering stdin lines that just work
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.