bruceoutdoors

#!/bin/bash
# Note: Must run as root!

cd /etc/wireguard/

# Get next available internal IP address
IP=$((`tac wg0.conf | grep -m1 -oP "[0-9]+(?=/32)" || echo 1` + 1))

# Generate client key
CLIENT_PRIVATE=`wg genkey`

bruceoutdoors

// simple matrix calculator
#include <iostream>
#include <cstdlib>
#include <limits> 

// A 3x3 matrix
const int M_SIZE = 3;
typedef double matrix[M_SIZE][M_SIZE];

// function prototypes

bruceoutdoors

#!/bin/bash
. matrix.sh
. mods.sh
. translator.sh

function hill_decrypt {
	key=${1// /} # clear spaces from key

	if [ ${#key} -lt 4 ];
	then

bruceoutdoors

bruceoutdoors

# python3

from collections import deque

# Store combinations as a tree. The size of the tree directly
# corresponds to the running time of the algorithm - O(2^n)
# Worst runtime is when the sum of items is larger than the target
# and no combination exist. An intuitive optimization here is to
# prune combinations away when the sum has already exceeded the target
class Node:

bruceoutdoors

# Python3 port of http://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/UF.java.html
class DisjointSet:
	"""
	Execution:    python disjoint_set.py < input.txt
	Data files:   http://algs4.cs.princeton.edu/15uf/tinyUF.txt
                  http://algs4.cs.princeton.edu/15uf/mediumUF.txt
                  http://algs4.cs.princeton.edu/15uf/largeUF.txt
	
	Weighted quick-union by rank with path compression.
	

bruceoutdoors

<?php

/* * **
 * 
 * This script converts an existing MySQL database to migrations in Laravel 4.
 * 
 * 1. Place this file inside app/controllers/
 * 
 * 2. In this file, edit the index() method to customize this script to your needs.
 *      - inside $migrate->ignore(), you pass in an array of table 

bruceoutdoors

public class Solution {
    private IList<IList<int>> graph;
    private bool[] marked;
    private bool[] onStack;
    private bool hasCycle;
    private Stack<int> s;
    
    public int[] FindOrder(int numCourses, int[,] prerequisites) {
        graph = new List<IList<int>>();
        marked = new bool[numCourses];

bruceoutdoors

public class Solution {
    private IList<IList<int>> graph;
    private bool[] marked;
    private bool[] onStack;
    private bool hasCycle;
    
    public bool CanFinish(int numCourses, int[,] prerequisites) {
        graph = new List<IList<int>>();
        marked = new bool[numCourses];
        onStack = new bool[numCourses];

bruceoutdoors

public class Solution {
    IList<IList<int>> graph;
    bool[] marked;
    
    public bool CanVisitAllRooms(IList<IList<int>> rooms) {
        graph = rooms;
        marked = new bool[rooms.Count];
        
        dfs(0);