Project for Advanced Algorithm and Parallel Programming course. Academic Year 2018-2019
-
Updated
Dec 27, 2020 - Cuda
Project for Advanced Algorithm and Parallel Programming course. Academic Year 2018-2019
Basic maze generator and solver created with python3 using tkinter.
MST use in Data Analysis, May 2020
Minimum spanning tree for a weighted, undirected graph
Algorithm to dynamically maintain the minimum spanning tree using Prim's Algorithm
A C++ library for computing triangulation and Traveling Saleseman Problem approximations
Graph search, shortest path , and MST algorithm visualizing software.
Program was created as a academic project at Wroclaw University of Science and Technology and allows to determine performance difference between two graph representations in various graph problems.
An abstract implementation of a Merkle Search Tree, structurally compatible with ATProto's instantiation
Decision Tree Classifier and Tree Algorithms
Implementation and application of graph theory, social network mining, reinforcement learning, and inverse reinforcement learning.
Contains a variety of projects which involve the utilization of Data Structures in C++. Follows many aspects of object-oriented design through the use of classes/inheritance/polyorphism
Computing MSTs with Prim's Algorithm
React Flow Boilerplate allows you to start new web project from scratch using React and Flow.
This is system is to reduce the number of colors in a full resolution digital color image to a smaller set of representative colors.
This is Task Management Web App . the technologies used are nextjs , MST , TypeTypescript, Javascript
Add a description, image, and links to the mst topic page so that developers can more easily learn about it.
To associate your repository with the mst topic, visit your repo's landing page and select "manage topics."