A point in 2D space. >>> Point(0, 0) Point(x=0.0, y=0.0) >>> Point(1.5, 2.5) Point(x=1.5, y=2.5)

Represents a 2D point with x and y coordinates.

A Red-Black tree, which is a self-balancing BST (binary search tree). This tree has similar performance to AVL trees, but the balancin

This class represents a vector of arbitrary size. You need to give the vector components. Overview of the methods: __init__(com

class: Matrix This class represents an arbitrary matrix. Overview of the methods: __init__(): __str__(): returns a stri

A Node has value variable and pointers to Nodes to its left and right.

Create an object representing a Poker Hand based on an input of a string which represents the best 5-card combination from the player's hand a

A Node represents an element of a binary tree, which contains: Attributes: data: The value stored in the node (int). left: Pointer t

Matrix object generated from a 2D array where each element is an array representing a row. Rows can contain type int or float. Common

A binary node has value variable and pointers to its left and right node.

<class Matrix> Matrix structure.

An interface to define search problems. The interface will be illustrated using the example of mathematical function.

r""" N-Order IIR filter Assumes working with float samples normalized on [-1, 1] --- Implementation details: Based on the 2nd-or

Class contains methods to compute partial derivatives of Variable based on the computation graph. Examples: >>> with GradientTracke

A binary tree node has a value, left child, and right child. Props: value: The value of the node. left: The left child of th

A TreeNode has data variable and pointers to TreeNode objects for its left and right children.

Class represents n-dimensional object which is used to wrap numpy array on which operations will be performed and the gradient will be calcul

A class for representing and manipulating triangular fuzzy sets. Attributes: name: The name or label of the fuzzy set. left_b

A stack is an abstract data type that serves as a collection of elements with two principal operations: push() and pop(). push() adds an eleme

Create and initialize Node class instance. >>> Node(20) Node(20) >>> Node("Hello, world!") Node(Hello, world!) >>> Node(None)

Container class for a _DataSet (deprecated). THIS CLASS IS DEPRECATED.

>>> astar = AStar((0, 0), (len(grid) - 1, len(grid[0]) - 1)) >>> (astar.start.pos_y + delta[3][0], astar.start.pos_x + delta[3][1]) (0, 1

Bezier curve is a weighted sum of a set of control points. Generate Bezier curves from a given set of control points. This implementation

This class is used to hold the bodies, the gravitation constant, the time factor and the softening factor. The time factor is used to contr

# Comment out slow pytests... # 9.15s call graphs/bidirectional_breadth_first_search.py:: \ # graphs.bidirectional_bre

Class cell represents a cell in the world which have the properties: position: represented by tuple of x and y coordinates initially set to (

Double Linked List Node built specifically for LRU Cache >>> DoubleLinkedListNode(1,1) Node: key: 1, val: 1, has next: False, has prev:

Double Linked List Node built specifically for LFU Cache >>> node = DoubleLinkedListNode(1,1) >>> node Node: key: 1, val: 1, freq: 0

>>> k = Node(0, 0, 4, 5, 0, None) >>> k.calculate_heuristic() 9 >>> n = Node(1, 4, 3, 4, 2, None) >>> n.calculate_heuristic()

>>> k = Node(0, 0, 4, 3, 0, None) >>> k.calculate_heuristic() 5.0 >>> n = Node(1, 4, 3, 4, 2, None) >>> n.calculate_heuristic()

A node in a Frequent Pattern tree. Args: name: The name of this node. num_occur: The number of occurrences of the node.

Represents an entity (either prey or predator). >>> e = Entity(True, coords=(0, 0)) >>> e.prey True >>> e.coords (0, 0)

A class representing an undirected weighted graph.

Hash map with open addressing.

A Max Heap Implementation >>> unsorted = [103, 9, 1, 7, 11, 15, 25, 201, 209, 107, 5] >>> h = Heap() >>> h.build_max_heap(unsorted) >

Class Instagram crawl instagram user information Usage: (doctest failing on GitHub Actions) # >>> instagram_user = InstagramUser("github

Node in a doubly-linked binomial tree, containing: - value - size of left subtree - link to left, right and parent no

Class represents operation between single or two Variable objects. Operation objects contains type of operation, pointers to input Variable

Class to contain the entire pipeline for SHA1 hashing algorithm >>> SHA1Hash(bytes('Allan', 'utf-8')).final_hash() '872af2d8ac3d8695387e7

Class to contain the entire pipeline for SHA1 Hashing Algorithm >>> SHA256(b'Python').hash '18885f27b5af9012df19e496460f9294d5ab7612

A side of a two dimensional Shape such as Polygon, etc. adjacent_sides: a list of sides which are adjacent to the current side angle: the

Dataclass representing triplet called token consisting of length, offset and indicator. This triplet is used during LZ77 compression.

An AVL tree doctest Examples: >>> t = AVLtree() >>> t.insert(4) insert:4 >>> print(str(t).replace(" \\n","\\n")) 4 *

Back Propagation Neural Network model

>>> bd_astar = BidirectionalAStar((0, 0), (len(grid) - 1, len(grid[0]) - 1)) >>> bd_astar.fwd_astar.start.pos == bd_astar.bwd_astar.target.po

>>> bd_bfs = BidirectionalBreadthFirstSearch((0, 0), (len(grid) - 1, ... len(grid[0]) - 1))

A max-heap implementation in Python >>> binary_heap = BinaryHeap() >>> binary_heap.insert(6) >>> binary_heap.insert(10) >>> binar

Defining the structure of BinaryTreeNode

r""" Min-oriented priority queue implemented with the Binomial Heap data structure implemented with the BinomialHeap class. It supports: