james-d-mitchell

#!/usr/bin/env python3


class ToddCoxeter:
    def __init__(self):
        self.nodes = [0]
        self.edges = None
        self.kappa = []
        self.next_node = 1
        self.R = []

Liam0205

#include <cassert>
#include <cmath>
#include <iostream>
#include <random>
#include <algorithm>
#include <limits>
#include <functional>
#include <map>
#include <vector>
#include <queue>

james-d-mitchell

# Sieve of Eratosthenes based on code from
# https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes#Pseudocode

MyPrimes := function(n)
  local A, limit, j, i;

  A := BlistList([1 .. n], [2 .. n]);
  limit := Int(Sqrt(Float(n)));
  for i in [1 .. limit] do 
    if A[i] then