MiguelSteph / data-structures-and-algorithm

Collection of abstract data structures implemented in Java

Data Structure and Algorithm Made Easy In Java

A data structure is a particular way of organizing data in a computer so that it can be used efficiently. Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks.

This is a collection of abstract data structures and algorithms implemented in Java. The code is well commented to allow an easy comprehension. Every data structure is well tested.

You can contact me at [e-mail]

Data Structures :

This repo contains the following data structure :

• List

  • Resizing Array Implementation of List

• LinkedList

  • Shingle LinkedList
  • Double LinkedList

• Stack

  • Resizing Array Implementation of Stack
  • Linked List Implementation of Stack

• Queue

  • Resizing Array Implementation of Queue
  • Linked List Implementation of Queue

• Priority Queue

  • Binary Heap implementation of Priority Queue

• Disjoint-Set

• SymbolTable

  • Binary Search Tree Implementation of SymbolTable
  • HashTable Implementation of SymbolTable using Linear Probing
  • HashTable Implementation of SymbolTable using Separate Chaining
  • Red-Black based implementation for Java custom TreeMap
    
    

Sorting Algorithm

• Selection Sort

• Insertion Sort

• Shell Sort

• Counting Sort (only for integer)

• Merge Sort

• Bottom Up Merge Sort

• Quick Sort

• Heap Sort

Algorithm on Graph

Graph representation

We have the following three graph representation :

• Edge List representation of graph

• Adjacency Matrix representation of graph

• Adjacency List representation of graph

Algorithm in Graph

• Problem of Reachability : Given a graph G and a vertex S, we want to output the collection of vertices v of G so that there is a path from S to v.

• Connected Components in Undirected graph

• Strongly Connected Components in Directed Graph

• Detect Cycle in Graph with DFS

• Linear ordering of Directed Graph with Topological Sort

• Most Direct Route with Breath First Search (BFS)

• Shortest Path with BellMan-Ford algorithm

• Shortest Path with Dijkstra algorithm

• Advanced Shortest Path with Bidirectional Dijkstra algorithm

• All Shortests Paths With Floyd Warshall algorithm

• Minimum Spanning Tree with Kruskal algorithm

Licence

The code is licensed under MIT License. Feel free to contribute to this repository.