Pinned Loading

1. Dijkstra's algorithm implementation ... Dijkstra's algorithm implementation using networkx (for graph dependency) and python's built-in queue library.

   1

   # dependencies for our dijkstra's implementation

   2

   from queue import PriorityQueue

   3

   from math import inf

   4

   # graph dependency  

   5

   import networkx as nx

2. (Mostly) Uniform Subset Covering – A... (Mostly) Uniform Subset Covering – A vectorized implementation of a sampling algorithm where we want to generate multiple permuted subsets each of size k with some minimum element replication factor r, with some elements being seen more than r times. It really all depends on the random number generation and only happens if n%k!=0

   1

   import gc

   2

   import statistics

   3

   import time

   4

   import typer

   5

   import numpy as np

3. a naive binary min-heap implementati... a naive binary min-heap implementation with an array backend. bubble up value swapping for insertions, and bubble down swapping for deletions

   1

   """implementation of a heap"""

   2

   from typing import TypeVar, Generic, List, Optional

   3

   4

   T = TypeVar('T')    # declare a type variable

   5

4. learning_loss_basics.ipynb learning_loss_basics.ipynb

   1

   {

   2

    "cells": [

   3

     {

   4

      "cell_type": "markdown",

   5

      "metadata": {},