Pinned Repositories
ford-fulkerson
The Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network.
gaussian-elimination
Gaussian elimination, also known as row reduction - algorithm for solving systems of linear equations
hash-merkle-tree
In cryptography and computer science, a hash tree or Merkle Hash Tree is a tree in which every "leaf" (node) is labelled with the cryptographic hash of a data block, and every node that is not a leaf (called a branch, inner node, or inode) is labelled with the cryptographic hash of the labels of its child nodes
tavrelkate's Repositories
tavrelkate/hash-merkle-tree
In cryptography and computer science, a hash tree or Merkle Hash Tree is a tree in which every "leaf" (node) is labelled with the cryptographic hash of a data block, and every node that is not a leaf (called a branch, inner node, or inode) is labelled with the cryptographic hash of the labels of its child nodes
tavrelkate/ford-fulkerson
The Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network.
tavrelkate/gaussian-elimination
Gaussian elimination, also known as row reduction - algorithm for solving systems of linear equations