dsa package

Submodules

• dsa.array module
  • Array
    • Array.append()
    • Array.capacity()
    • Array.count
    • Array.delete()
    • Array.extend()
    • Array.from_list()
    • Array.insert()
    • Array.is_empty()
    • Array.shift_left()
    • Array.shift_right()
    • Array.to_list()
  • CircularArray
    • CircularArray.append()
    • CircularArray.delete()
    • CircularArray.insert()
    • CircularArray.raw_view()
    • CircularArray.to_list()
  • DynamicArray
    • DynamicArray.append()
    • DynamicArray.check_capacity()
    • DynamicArray.delete()
    • DynamicArray.extend()
    • DynamicArray.grow()
    • DynamicArray.insert()
    • DynamicArray.shrink()
• dsa.deque module
  • Deque
    • Deque.append_left()
    • Deque.append_right()
    • Deque.back()
    • Deque.capacity()
    • Deque.from_list()
    • Deque.front()
    • Deque.is_empty()
    • Deque.peek_left()
    • Deque.peek_right()
    • Deque.pop_back()
    • Deque.pop_front()
    • Deque.pop_left()
    • Deque.pop_right()
    • Deque.push_back()
    • Deque.push_front()
    • Deque.to_list()
  • DynamicDeque
    • DynamicDeque.append_left()
    • DynamicDeque.append_right()
    • DynamicDeque.check_capacity()
    • DynamicDeque.grow()
    • DynamicDeque.pop_left()
    • DynamicDeque.pop_right()
    • DynamicDeque.shrink()
• dsa.dijkstra module
  • find_path()
  • shortest_path()
• dsa.doublylinkedlist module
  • DoublyLinkedList
    • DoublyLinkedList.append()
    • DoublyLinkedList.delete()
    • DoublyLinkedList.delete_head()
    • DoublyLinkedList.delete_tail()
    • DoublyLinkedList.from_list()
    • DoublyLinkedList.insert_after()
    • DoublyLinkedList.prepend()
    • DoublyLinkedList.to_list()
    • DoublyLinkedList.traverse_reverse()
  • Node
    • Node.next
    • Node.prev
    • Node.value
• dsa.draw module
  • Draw
    • Draw.draw()
    • Draw.render()
    • Draw.save()
    • Draw.set_figsize()
  • GraphDraw
    • GraphDraw.graph
    • GraphDraw.directed
    • GraphDraw.weighted
    • GraphDraw.render()
  • HeapDraw
    • HeapDraw.heap
    • HeapDraw.array_to_node()
    • HeapDraw.render()
  • TreeDraw
    • TreeDraw.tree
    • TreeDraw.add_edges()
    • TreeDraw.render()
  • TrieDraw
    • TrieDraw.trie
    • TrieDraw.hierarchical_pos()
    • TrieDraw.render()
    • TrieDraw.to_networkx()
• dsa.generators module
  • linear_doubly_linked_list()
  • linear_dynamic_queue()
  • linear_dynamic_stack()
  • linear_linked_list()
  • linear_queue()
  • linear_stack()
  • random_adjacency_list_graph()
  • random_adjacency_list_weighted_graph()
  • random_adjacency_matrix_graph()
  • random_adjacency_matrix_weighted_graph()
  • random_array()
  • random_binary_tree()
  • random_binary_tree_node()
  • random_deque()
  • random_doubly_linked_list()
  • random_dynamic_queue()
  • random_dynamic_stack()
  • random_dynamicarray()
  • random_heap()
  • random_linked_list()
  • random_queue()
  • random_stack()
  • random_trie()
• dsa.graph module
  • AdjacencyListGraph
    • AdjacencyListGraph.add_directed_edge()
    • AdjacencyListGraph.add_edge()
    • AdjacencyListGraph.add_vertex()
    • AdjacencyListGraph.adjacents()
    • AdjacencyListGraph.delete_edge()
    • AdjacencyListGraph.delete_vertex()
    • AdjacencyListGraph.edges()
    • AdjacencyListGraph.from_dict()
    • AdjacencyListGraph.has_edge()
    • AdjacencyListGraph.has_vertex()
    • AdjacencyListGraph.order()
    • AdjacencyListGraph.size()
    • AdjacencyListGraph.to_dict()
    • AdjacencyListGraph.undirected_edges()
    • AdjacencyListGraph.vertices()
  • AdjacencyListWeightedGraph
    • AdjacencyListWeightedGraph.add_edge()
    • AdjacencyListWeightedGraph.adjacent_items()
    • AdjacencyListWeightedGraph.adjacents()
    • AdjacencyListWeightedGraph.delete_edge()
    • AdjacencyListWeightedGraph.edges()
    • AdjacencyListWeightedGraph.from_dict()
    • AdjacencyListWeightedGraph.get_weight()
    • AdjacencyListWeightedGraph.undirected_edges()
  • AdjacencyMatrixGraph
    • AdjacencyMatrixGraph.add_edge()
    • AdjacencyMatrixGraph.add_vertex()
    • AdjacencyMatrixGraph.adjacents()
    • AdjacencyMatrixGraph.delete_edge()
    • AdjacencyMatrixGraph.delete_vertex()
    • AdjacencyMatrixGraph.edges()
    • AdjacencyMatrixGraph.from_dict()
    • AdjacencyMatrixGraph.has_edge()
    • AdjacencyMatrixGraph.has_vertex()
    • AdjacencyMatrixGraph.order()
    • AdjacencyMatrixGraph.print_graph()
    • AdjacencyMatrixGraph.size()
    • AdjacencyMatrixGraph.to_dict()
    • AdjacencyMatrixGraph.undirected_edges()
    • AdjacencyMatrixGraph.vertices()
  • AdjacencyMatrixWeightedGraph
    • AdjacencyMatrixWeightedGraph.add_edge()
    • AdjacencyMatrixWeightedGraph.adjacent_items()
    • AdjacencyMatrixWeightedGraph.edges()
    • AdjacencyMatrixWeightedGraph.from_dict()
    • AdjacencyMatrixWeightedGraph.get_weight()
    • AdjacencyMatrixWeightedGraph.print_graph()
    • AdjacencyMatrixWeightedGraph.undirected_edges()
  • Graph
    • Graph.create()
    • Graph.create_adjacency_list()
    • Graph.create_adjacency_matrix()
    • Graph.from_dict()
• dsa.hashset module
  • HashSet
    • HashSet.add()
    • HashSet.contains()
    • HashSet.from_list()
    • HashSet.remove()
    • HashSet.to_list()
• dsa.hashtable module
  • HashTable
    • HashTable.count
    • HashTable.enumerate()
    • HashTable.get()
    • HashTable.hash_function()
    • HashTable.key_exists()
    • HashTable.pop()
    • HashTable.remove()
    • HashTable.set()
    • HashTable.show_buckets()
• dsa.heap module
  • Heap
    • Heap.count()
    • Heap.enumerate()
    • Heap.extract_max()
    • Heap.from_list()
    • Heap.has_left()
    • Heap.has_parent()
    • Heap.has_right()
    • Heap.heapify_down()
    • Heap.heapify_up()
    • Heap.insert()
    • Heap.is_empty()
    • Heap.last()
    • Heap.left_index()
    • Heap.parent_index()
    • Heap.peek()
    • Heap.pop()
    • Heap.print()
    • Heap.raw_view()
    • Heap.right_index()
    • Heap.root()
    • Heap.to_sorted_list()
  • MinHeap
    • MinHeap.extract_min()
    • MinHeap.heapify_down()
    • MinHeap.heapify_up()
  • PriorityQueue
    • PriorityQueue.peek()
    • PriorityQueue.peek_pair()
    • PriorityQueue.pop()
    • PriorityQueue.pop_pair()
    • PriorityQueue.push()
    • PriorityQueue.to_string_with_priority()
• dsa.huffman module
  • bitstring_to_bytes()
  • build_frequency_table()
  • build_huffman_dictionary()
  • build_huffman_tree()
  • bytes_to_bitstring()
  • character_frequency()
  • huffman_decode()
  • huffman_encode()
• dsa.pretty_print module
  • fill_complete_tree()
  • get_tree_height()
  • heap_print()
  • tree_print()
  • tree_to_array()
• dsa.prim module
  • mst_weight()
  • prims_mst()
• dsa.queue module
  • CircularQueue
    • CircularQueue.dequeue()
    • CircularQueue.enqueue()
    • CircularQueue.peek()
  • DynamicQueue
    • DynamicQueue.check_capacity()
    • DynamicQueue.enqueue()
    • DynamicQueue.grow()
  • Queue
    • Queue.capacity()
    • Queue.count
    • Queue.dequeue()
    • Queue.enqueue()
    • Queue.from_list()
    • Queue.is_empty()
    • Queue.peek()
    • Queue.raw_view()
    • Queue.to_ordered_list()
• dsa.singlylinkedlist module
  • LinkedList
    • LinkedList.append()
    • LinkedList.delete()
    • LinkedList.delete_head()
    • LinkedList.delete_tail()
    • LinkedList.from_list()
    • LinkedList.insert_after()
    • LinkedList.is_empty()
    • LinkedList.prepend()
    • LinkedList.search()
    • LinkedList.to_list()
    • LinkedList.traverse()
  • Node
    • Node.next
    • Node.value
• dsa.sorttools module
  • array_details()
  • filled_array()
  • generate_almost_sorted_array()
  • is_sorted()
  • rand_int_array()
  • shuffle_array()
• dsa.stack module
  • DynamicStack
    • DynamicStack.check_capacity()
    • DynamicStack.grow()
    • DynamicStack.pop()
    • DynamicStack.push()
    • DynamicStack.shrink()
  • Stack
    • Stack.capacity()
    • Stack.count
    • Stack.from_list()
    • Stack.is_empty()
    • Stack.peek()
    • Stack.pop()
    • Stack.push()
    • Stack.to_list()
    • Stack.top()
• dsa.tree module
  • Tree
    • Tree.delete()
    • Tree.delete_iterative()
    • Tree.delete_node()
    • Tree.insert()
    • Tree.insert_iterative()
    • Tree.insert_rec()
    • Tree.predecessor_node()
    • Tree.print()
    • Tree.search()
    • Tree.successor_node()
  • TreeNode
    • TreeNode.copy()
    • TreeNode.print()
• dsa.trie module
  • Trie
    • Trie.build_word_list()
    • Trie.copy()
    • Trie.copy_node()
    • Trie.delete()
    • Trie.end_marker
    • Trie.insert()
    • Trie.list_words()
    • Trie.prefix()
    • Trie.root
    • Trie.search()
    • Trie.search_node()
    • Trie.suggest()
  • TrieNode
    • TrieNode.children

Module contents

dsa package for UC Berkeley Extension’s Computer Science X404.1 Data Structures and Algorithms class

Last Revision: 7/1/2026