index.js

const SinglyLinkedList = require('./data-structures/linked-lists/SinglyLinkedList');
const DoublyLinkedList = require('./data-structures/linked-lists/DoublyLinkedList');
const CircularLinkedList = require('./data-structures/linked-lists/CircularLinkedList');
const Stack = require('./data-structures/stacks-and-queues/Stack');
const Queue = require('./data-structures/stacks-and-queues/Queue');
const HashTable = require('./data-structures/hash-tables/HashTable');
const Set = require('./data-structures/sets-and-maps/Set');
const BinaryTree = require('./data-structures/trees/BinaryTree');
const AVLTree = require('./data-structures/trees/AVLTree');
const RedBlackTree = require('./data-structures/trees/RedBlackTree');
const TreeNode = require('./data-structures/trees/TreeNode');
const MinHeap = require('./data-structures/heaps/MinHeap');
const MaxHeap = require('./data-structures/heaps/MaxHeap');
const Graph = require('./data-structures/graphs/Graph');
const GraphNode = require('./data-structures/graphs/GraphNode');
const DisjointSet = require('./data-structures/disjoint-set/DisjointSet');
const Trie = require('./data-structures/trie/Trie');
const BubbleSort = require('./algorithms/sorting/bubbleSort');
const InsertionSort = require('./algorithms/sorting/insertionSort');
const MergeSort = require('./algorithms/sorting/mergeSort');
const SelectionSort = require('./algorithms/sorting/selectionSort');
const QuickSort = require('./algorithms/sorting/quickSort');
const CountingSort = require('./algorithms/sorting/countingSort');
const RadixSort = require('./algorithms/sorting/radixSort');
const HeapSort = require('./algorithms/sorting/heapSort');
const LinearSearch = require('./algorithms/searching/linearSearch');
const BinarySearch = require('./algorithms/searching/binarySearch');
const DepthFirstSearch = require('./algorithms/searching/depthFirstSearch');
const GraphNode = require('./algorithms/searching/depthFirstSearch');
const BreadthFirstSearch = require('./algorithms/searching/breadthFirstSearch');
const GraphNode = require('./algorithms/searching/breadthFirstSearch');
const Dijkstra = require('./algorithms/graph-algorithms/dijkstra');
const BellmanFord = require('./algorithms/graph-algorithms/bellmanFord');
const Kruskal = require('./algorithms/graph-algorithms/kruskal');
const Prim = require('./algorithms/graph-algorithms/prim');
const FloydWarshall = require('./algorithms/graph-algorithms/floydWarshall');
const TopologicalSort = require('./algorithms/graph-algorithms/topologicalSort');
const Fibonacci = require('./algorithms/dynamic-programming/fibonacci');
const LongestCommonSubsequence = require('./algorithms/dynamic-programming/longestCommonSubsequence');
const Knapsack = require('./algorithms/dynamic-programming/knapsack');
const EditDistance = require('./algorithms/dynamic-programming/editDistance');
const MatrixChainMultiplication = require('./algorithms/dynamic-programming/matrixChainMultiplication');
const StringMatching = require('./algorithms/string/stringMatching');
const LevenshteinDistance = require('./algorithms/string/levenshteinDistance');
const LongestCommonSubstring = require('./algorithms/string/longestCommonSubstring');
const ConvexHull = require('./algorithms/geometry/convexHull');
const ClosestPairOfPoints = require('./algorithms/geometry/closestPairOfPoints');
const LineIntersection = require('./algorithms/geometry/lineIntersection');
const FordFulkerson = require('./algorithms/network-flow/fordFulkerson');
const MaxFlowMinCutGraph = require('./algorithms/network-flow/maxFlowMinCutTheorem');
const GCD = require('./algorithms/numerical/gcd');
const PrimalityTesting = require('./algorithms/numerical/primalityTesting');
const FastExponentiation = require('./algorithms/numerical/fastExponentiation');
const KMeansClustering = require('./algorithms/ml-statistical/kMeansClustering');
const LinearRegression = require('./algorithms/ml-statistical/linearRegression');
const LogisticRegression = require('./algorithms/ml-statistical/logisticRegression');
const DecisionTree = require('./algorithms/ml-statistical/decisionTrees');
const RandomizedQuickSort = require('./algorithms/sorting/randomizedQuickSort');
const RandomizedPrimalityTesting = require('./algorithms/randomized/randomizedPrimalityTesting');
const UtilityFunctions = require('./utils/utilityFunctions');
// Import other data structures and algorithms as needed

module.exports = {
    // Export your data structures and algorithms here
    SinglyLinkedList,
    DoublyLinkedList,
    CircularLinkedList,
    Stack,
    Queue,
    HashTable,
    Set,
    BinaryTree,
    AVLTree,
    RedBlackTree,
    TreeNode,
    MinHeap,
    MaxHeap,
    Graph,
    GraphNode,
    DisjointSet,
    Trie,
    BubbleSort,
    InsertionSort,
    MergeSort,
    SelectionSort,
    QuickSort,
    CountingSort,
    RadixSort,
    HeapSort,
    LinearSearch,
    BinarySearch,
    DepthFirstSearch,
    GraphNode,
    BreadthFirstSearch,
    GraphNode,
    Dijkstra,
    BellmanFord,
    Kruskal,
    Prim,
    FloydWarshall,
    TopologicalSort,
    Fibonacci,
    LongestCommonSubsequence,
    Knapsack,
    EditDistance,
    MatrixChainMultiplication,
    StringMatching,
    LevenshteinDistance,
    LongestCommonSubstring,
    ConvexHull,
    ClosestPairOfPoints,
    LineIntersection,
    FordFulkerson,
    MaxFlowMinCutGraph,
    GCD,
    PrimalityTesting,
    FastExponentiation,
    KMeansClustering,
    LinearRegression,
    LogisticRegression,
    DecisionTree,
    RandomizedQuickSort,
    RandomizedPrimalityTesting,
    UtilityFunctions,
    // Export other data structures and algorithms as well
};