Types & classes — github.com/ashish-chopra/Structures

CodeHub MCPcopy Create free account

hub / github.com/ashish-chopra/Structures / types & classes

Types & classes106 in github.com/ashish-chopra/Structures

⨍ Functions 393◇ Types & classes 106

ClassAcceptanceTester

<code>AcceptanceTester</code> was designed with v1.0 release to implement the test in-house test framework. It consists of a collection of test cases

src/test/java/com/AcceptanceTester.java:26

src/test/java/com/graph/BFSTest.java:12

BST stands for Binary Search Tree is a basic tree structure used to keep data in binary searchable format. On every compare, one side of tree is prune

src/main/java/com/trees/BST.java:52

src/test/java/com/trees/BSTTest.java:15

Bag data structure is used to store collection of items irrespective of fashion they inserted. It allows user to add an item and iterate over the coll

src/main/java/com/bags/Bag.java:28

ClassBagIterator

src/main/java/com/bags/Bag.java:87

src/test/java/com/bags/BagsTest.java:6

ClassBasicOperations

src/main/java/com/graphs/BasicOperations.java:14

ClassBreadthFirstSearch

Process a graph in BFS fashion to determine the minimum path between a source vertex and any given vertex. @author Ashish Chopra

src/main/java/com/graphs/BreadthFirstSearch.java:26

src/main/java/com/applications/Buffer.java:26

ClassCheckpoint

src/main/java/com/applications/Checkpoint.java:29

ClassCheckpointTest

src/test/java/com/applications/CheckpointTest.java:5

ClassCircularLinkedList

src/main/java/com/lists/CircularLinkedList.java:28

ClassCircularLinkedListIterator

src/main/java/com/lists/CircularLinkedList.java:188

src/test/java/com/sorting/HeapSortTest.java:71

src/test/java/com/sorting/MergeSortTest.java:56

src/test/java/com/sorting/SelectionSortTest.java:51

ClassConnectedComponents

It processes the given graph to identify the connected components and mark each vertex to the component id to which it belongs to. @author Ashish Chop

src/main/java/com/graphs/ConnectedComponents.java:26

ClassConnectedComponentsTest

src/test/java/com/graph/ConnectedComponentsTest.java:16

Cycle detects if the given graph contains cycle or not. @author Ashish Chopra

src/main/java/com/graphs/Cycle.java:21

src/test/java/com/graph/CycleTest.java:12

src/test/java/com/graph/DFSTest.java:12

ClassDepthFirstSearch

src/main/java/com/graphs/DepthFirstSearch.java:31

Deque is an adaptation of queue in which elements can be inserted and removed from front as well as from end. It implements <code>Iterable</code> inte

src/main/java/com/queues/Deque.java:35

ClassDequeIterator

An iterator implementation for Deque data structure. @author Ashish Chopra

src/main/java/com/queues/Deque.java:167

src/test/java/com/queues/DequeTest.java:9

ClassFixedCapacityQueueOfStrings

FixedCapacityQueueOfStrings is a queue data structure to store string elements. @author Ashish Chopra

src/main/java/com/queues/FixedCapacityQueueOfStrings.java:27

ClassFixedCapacityStackOfStrings

FixedCapacityStack is another implementation of elementary data structure called stack using arrays. In order to determine the size of the array, we a

src/main/java/com/stacks/FixedCapacityStackOfStrings.java:38

ClassFixedCapacityStackOfStringsTest

src/test/java/com/stacks/FixedCapacityStackOfStringsTest.java:5

ClassFlightsGraphTest

src/test/java/com/graph/FlightsGraphTest.java:7

Graph is an ADT that represents a collection of vertices V and the connection amongst them called edges E. Every Graph G is defined as function of G =

src/main/java/com/graphs/Graph.java:54

src/test/java/com/graph/GraphTest.java:12

src/main/java/com/sorting/Heap.java:31

ClassHeapSortTest

src/test/java/com/sorting/HeapSortTest.java:7

ClassHumpingDumping

src/main/java/com/applications/HumpingDumping.java:21

ClassHumpingDumpingTest

src/test/java/com/applications/HumpingDumpingTest.java:5

ClassIdenticals

src/main/java/com/applications/Identicals.java:18

ClassIdenticalsTest

src/test/java/com/applications/IdenticalsTest.java:6

ClassInfixExpression

src/main/java/com/applications/InfixExpression.java:21

src/main/java/com/sorting/Insertion.java:34

ClassInsertionSortTest

src/test/java/com/sorting/InsertionSortTest.java:7

src/main/java/com/applications/Threading.java:33

src/main/java/com/applications/Threading.java:58

Josephus is simulation of Josephus problem which accepts two integers from command line N, M and will print the series of execution. This implementati

src/main/java/com/applications/Josephus.java:26

ClassLinkedList

LinkedList is a generic data structure to store elements in list manner. LinkedList provides following API ------------------------------------------

src/main/java/com/lists/LinkedList.java:37

ClassLinkedListIterator

src/main/java/com/lists/LinkedList.java:168

ClassLinkedListNode

src/main/java/com/lists/CircularLinkedList.java:206

ClassLinkedListTest

src/test/java/com/lists/LinkedListTest.java:7

src/main/java/com/sorting/Merge.java:33

ClassMergeSortTest

src/test/java/com/sorting/MergeSortTest.java:7

ClassMoveToFront

src/main/java/com/applications/MoveToFront.java:21

src/main/java/com/queues/Queue.java:82

private structure used to represent each item in this data structure. @author Ashish Chopra

src/main/java/com/queues/Deque.java:156

src/main/java/com/queues/Steque.java:37

Node class represents a node used to store each element of the queue. It is the underlying implementation of the queue not accessible to client via AP

src/main/java/com/queues/QueueOfStrings.java:84

src/main/java/com/applications/MoveToFront.java:76

src/main/java/com/tables/UnorderedST.java:161

src/main/java/com/trees/BST.java:56

src/main/java/com/lists/LinkedList.java:181

Node class represents a single node used to store single element on the stack in a link based implementation. @author Ashish Chopra

src/main/java/com/stacks/Stack.java:125

src/main/java/com/stacks/StackOfStrings.java:42

Node representation of each item of stack @author Ashish Chopra

src/main/java/com/stacks/StackWithMiddle.java:128

ClassParanthesis

Paranthesis computes the maximum depth of paranthesis in given aithemtic expression as String. @author Ashish Chopra

src/main/java/com/applications/Paranthesis.java:22

ClassPercolation

src/main/java/com/applications/Percolation.java:12

Queue is a generic data structure to store elements in first-in-first-out manner. @author Ashish Chopra @version 1.0 @param <Item>

src/main/java/com/queues/Queue.java:26

ClassQueueIterator

src/main/java/com/queues/Queue.java:87

ClassQueueOfStrings

QueueOfStrings is a queue data structure designed to store elements of String type. @author Ashish Chopra

src/main/java/com/queues/QueueOfStrings.java:29

src/main/java/com/sorting/Quick.java:27

ClassQuickSortTest

src/test/java/com/sorting/QuickSortTest.java:5

QuickUF data structure is an improvement over UnionFind in which union operation is improved to be carried out in constant time. @author Ashish Chopr

src/main/java/com/unions/QuickUF.java:24

ClassQuickUFTest

src/test/java/com/unions/QuickUFTest.java:5

ClassRandomQueueIterator

src/main/java/com/queues/RandomizedQueue.java:116

ClassRandomizedQueue

RandomizedQueueOfStrings is a queue to store string items in queue(FIFO) fashion. It supports the enqueue operation to add an item to the queue, but

src/main/java/com/queues/RandomizedQueue.java:25

ClassRandomizedQueueTest

src/test/java/com/queues/RandomizedQueueTest.java:5

ClassResizingCapacityStackOfStrings

ResizingCapacityStackOfStrings is a stack implementation using resizale arrays. This removes the defect of earlier implementation which leaks the deta

src/main/java/com/stacks/ResizingCapacityStackOfStrings.java:29

ClassResizingCapacityStackOfStringsTest

src/test/java/com/stacks/ResizingCapacityStackOfStringsTest.java:5

ClassResizingQueueOfStrings

ResizingQueueOfStrings is a queue data structure developed to store String items in first-in-first-out principle. It supports enqueue operation to ins

src/main/java/com/queues/ResizingQueueOfStrings.java:27

ClassRingBuffer

RingBuffer is a buffer designed to store data of <code>String</code> type, typcally generated by a producer. It supports methods of <code>queue</code>

src/main/java/com/applications/RingBuffer.java:26

ClassRingBufferTest

src/test/java/com/applications/RingBufferTest.java:7

src/main/java/com/tables/ST.java:20

src/test/java/com/tables/STTest.java:5

src/main/java/com/sorting/Selection.java:38

ClassSelectionSortTest

src/test/java/com/sorting/SelectionSortTest.java:5

src/main/java/com/sorting/Shell.java:19

ClassShellSortTest

src/test/java/com/sorting/ShellSortTest.java:7

Stack is a general implementation of abstract data structure to store any homogenous type of elements in Last-In-First-Out fashion. @author Ashish Ch

src/main/java/com/stacks/Stack.java:37

ClassStackIterator

StackIterator implements Iterator interface to provide iterable capabilities to the stack data structure. @author Ashish Chopra

src/main/java/com/stacks/Stack.java:138

ClassStackOfStrings

StackOfStrings is a implementation of elmentary data structure called <em>Stacks</em>, which is used to store items of String type. @author Ashish Ch

src/main/java/com/stacks/StackOfStrings.java:38

ClassStackOfStringsTest

src/test/java/com/stacks/StackOfStringsTest.java:5

src/test/java/com/stacks/StackTest.java:5

ClassStackWithMiddle

StackWithMiddle is an elementary stack data structure with additional middle operations like findMiddle and deleteMiddle. @author Ashish Chopra

src/main/java/com/stacks/StackWithMiddle.java:22

Steque is a stack-ended data structure which supports stack operations as well as queue's enqueue operation. @author Ashish Chopra @version 1.0

src/main/java/com/queues/Steque.java:33

ClassStequeIterator

src/main/java/com/queues/Steque.java:121

ClassStequeTest

src/test/java/com/queues/StequeTest.java:5

This class tests the RandomizedQueue implementation by accepting N number of input strings and printing back random k strings back to the output. @aut

src/main/java/com/applications/Subset.java:27

ClassSymbolGraph

SymbolGraph ADT abstracts the representation of real world situations of Graph consists of non-integer vertices. It uses the Graph ADT as the underlyi

src/main/java/com/graphs/SymbolGraph.java:48

ClassTableIterator

src/main/java/com/tables/UnorderedST.java:178

<Code>Test</code> type is created to mark test case classes as test which is recognizable by <code>AcceptanceTester</code> test suite. With the intro

src/test/java/com/Test.java:27

src/main/java/com/applications/Threading.java:3

src/main/java/com/applications/Threading.java:16

next →1–100 of 106, ranked by callers