Discover @abhichand26 Open Source projects

Abhishek Chand (@abhichand26)

abhichand26

Stars
74
Global Rank 258,484 (Top 9 %)
Followers 17
Following 14
Registered over 5 years ago
Most used languages

C
70.4 %

Jupyter Notebook
25.9 %

Python
3.7 %
Location 🇮🇳 India
Country Total Rank 8,106
Country Ranking

C
173

Jupyter Notebook
1,950

vehicle-routing

Vehicle Routing Pickup-Delivery scheduling is implemented, which used a meta-heuristic algorithm known as Tabu Search to determine the most efficient route for each vehicle.

Jupyter Notebook

kruskal-mst

Implementation of Kruskal Algorithm to find minimum spanning tree using Union-Find method

sorting-algorithms

Implementation of sorting algorithms like Bubble, Selection, Insertion, Merge, Quick and Heap Sort.

v-SVR-using-brain-storm-optimization

Using PCA feature selection and then optimizing parameters of v-SVR (nu-SVR) model using Brain Storm Optimization to predict stock price using various indicators.

Jupyter Notebook

dijkstra-list

Implementation of Dijkstra Algorithm using Adjacency List to find single source shortest path

floyd-warshall-algorithm

Implementation of Floyd–Warshall algorithm to find all-pair shortest paths

longest-common-subsequence

Program to find longest common sub-sequence using Dynamic Programming

prims-mst

Implementation of Prims Algorithm to find minimum spanning tree using Adjacency List

google-images-scrap

A python script to scrap google images using Selenium

matrix-chain-multiplication

Program to find minimum no. of multiplications required to find product of n matrices using Dynamic Programming

searching-algorithms

Implementation of Linear & Binary Search

fibonacci-term

A program to calculate n'th term of Fibonacci series using dynamic programming

optimal-binary-search-tree

Program to implement Optimal Binary Search Tree using Dynamic Programming

longest-common-subword

Program to find longest common sub-words using Dynamic Programming

priority-queue

Implementation of Priority Queue data structure

activity-selection

Implementation of Activity Selection

longest-increasing-sequence

Program to find longest increasing sequence using Dynamic Programming

bellman-ford-algorithm

Implementation of Bellman-Ford Algorithm to find single source shortest path while handling negative cycles

breadth-first-search

Implementation of breadth first search

sentimental-analysis

Implementation of various classification techniques to classify movie reviews as positive or negative sentiment

Jupyter Notebook

k-means

Implementation of k-means algorithm for clustering

Jupyter Notebook

depth-first-search

Implementation of depth first search

clara-clustering

Implementation of CLARA for clustering

Jupyter Notebook

fractional-knapsack

Implementation of fractional knapsack problem

0-1-knapsack

Program to implement 0-1 knapsack problem

decision-tree

Implementation of decision tree

Jupyter Notebook

apriori-algorithm

Implementation of Apriori algorithm for Association Rule Mining

Jupyter Notebook