A collection of algorithms and data structures
-
Updated
Nov 4, 2024 - Java
A collection of algorithms and data structures
BitMagic Library
Creation of interactive networks using d3 Javascript
Load and view .npy files containing 2D and 1D NumPy arrays.
🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin
Easy python bot for scraping Twitch chat data
Creative an interactive adjacency matrix of your Obsidian vault
Using the adjacency matrix and random forest get the Name, Address, Items, Prices, Grand total from all kind of invoices.
Creating an Adjacency Matrix Using the Dijkstra Algorithm for Graph Convolutional Networks GCNs
This GitHub repository provides an implementation of the paper "MAGNET: Multi-Label Text Classification using Attention-based Graph Neural Network" . MAGNET is a state-of-the-art approach for multi-label text classification, leveraging the power of graph neural networks (GNNs) and attention mechanisms.
This is the collection of solutions to some computer problems, mainly leetcode
Simple graph classes
Currency Arbitrage solution with graphs
My codes for CSE221 Brac University in Python 3.
Consistency-aware and inconsistency-aware graph-based multi-view clustering
d3heatmap is a Python package to create interactive heatmaps based on d3js.
Python code for visualizations of algorithms that provide approximate solutions to TSP along with two lower bound approximations
Implementation of graph theory algorithms from scratch using python
The implementation of the ant colony optimization algorithm. Allows to solve Travelling Salesman Problem , Shortest path problem, etc.
Dijkstra adjacency distance matrices were calculated for 40 cities from traffic sensor locations provide by UTD19 https://utd19.ethz.ch/.
Add a description, image, and links to the adjacency-matrix topic page so that developers can more easily learn about it.
To associate your repository with the adjacency-matrix topic, visit your repo's landing page and select "manage topics."