Mastering Algorithms with C 《算法精解：C语言描述》源码及Xcode工程、Linux工程

Currently Implemented Path Finding (Dijkstras, BFS, A Star, BiDirectional) Sorting (Merge, Quick, Heap, Bubble, Insertion, Selection) Backtracking (NQueen Problem) Searching (Linear, Binary)

High-quality LeetCode solutions

The repository algorithms implemented on the Go

GAP Benchmark Suite

Jigsaw puzzle based on Vue（基于Vue的拼图小游戏，可自动拼图。还包含Weex版）

modular and modern graph-theory algorithms framework in Java

JavaScript AC solutions to problems on LeetCode

AI research environment for the game of Snake 🐍 .

Point Grey (FLIR) Spinnaker based camera driver (Blackfly S etc.)

🍃 Agnostic tree traversal library.

This a repository for WPI CS2223 Algorithms D Term 2018

breaking cycles in noisy hierarchies

My solved challenges and hacks (Golang, Java, Python)

NamuWiki route finder

Different Searching algorithms (DFS, BFS, IDS, Greedy, A*) opting to find optimal path from source to destination

Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.

Library for functional graph & geometry algorithms

使用Canvas制作的围住神经猫，算法基于广度优先搜索实现。

I have written some important Algorithms and Data Structures in an efficient way in Java with proper references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, All Pair Shortest Path, Longest Common Subsequence, Binary Search, Lower Bound Search, Maximal Matching, Matrix Exponentiation, Segment Tree, Sparse Table, Merge Sort, Miller Prime Test, Prims - Minimum Spanning Tree, BIT - Binary Index Tree, Two Pointers, BST - Binary Search Tree, Maximum Subarray Sum, Immutable Data Structures, Persistent Data Structurs - Persistent Trie, Dijkstra, Z - Function, Minimum Cost Maximal Matching, Heavy Light Decomposition, Knapsack, Suffix Array and LCP - Longest Common Prefix, Squre Root Decomposition, Kth Order Statics, Trie / Prefix Tree, LIS - Longest Increasing Subsequence

Graph Theory Algorithm is implemented in python. Jupyter Notebook is used to demonstrate the concept and Networkx library is used in several algorithms to visualize the graph.

World championship code for Graph500

This project contains the implementation of basic graph theory algorithms like BFS, DFS, Kruskal's MST, Prim's MST, Dijkstras Shortest Path

Resources for Competitive Programming

AI plays snake game using BFS (Breadth-First Search) algorithm.

All projects of Data Structure course in an integrated GUI application

A Snake gameplay and auto play base on BFS , A-star and Greedy Algorithm

NLP Course stuff and algorithm implementations

Javascript implementation of data-structures and algorithms