You should install VirtualBox and Vagrant before you start.
You should create a Vagrantfile
in an empty directory with the following content:
# Source: https://gist.github.com/808108069f709572f1bc372c65f6b5c0 | |
########### | |
# Prepare # | |
########### | |
# Option 1: | |
# Create a Kubernetes cluster | |
# Install NGINX Ingress | |
# Install Argo CD |
# Source: https://gist.github.com/dc4ba562328c1d088047884026371f1f | |
########################################################### | |
# Using Knative To Deploy And Manage Serverless Workloads # | |
########################################################### | |
###################### | |
# Installing Knative # | |
###################### |
You should install VirtualBox and Vagrant before you start.
You should create a Vagrantfile
in an empty directory with the following content:
-- Remove the history from | |
rm -rf .git | |
-- recreate the repos from the current content only | |
git init | |
git add . | |
git commit -m "Initial commit" | |
-- push to the github remote repos ensuring you overwrite history | |
git remote add origin git@github.com:<YOUR ACCOUNT>/<YOUR REPOS>.git |
rsync (Everyone seems to like -z, but it is much slower for me)
#define MAX 500 | |
class Dinic { | |
int n, m, head[MAXN], level[MAXN], s, t, work[MAXN]; | |
struct edge { | |
int v, c, f, nxt; | |
edge() {} | |
edge(int v, int c, int f, int nxt): v(v), c(c), f(f), nxt(nxt) {} | |
} e[MAXM]; | |
bool _bfs() { | |
static int q[MAXN]; |
import pdb | |
""" | |
The Bellman-Ford algorithm | |
Graph API: | |
iter(graph) gives all nodes | |
iter(graph[u]) gives neighbours of u | |
graph[u][v] gives weight of edge (u, v) | |
""" |
// Copyright 2009 The Go Authors. All rights reserved. | |
// Use of this source code is governed by a BSD-style | |
// license that can be found in the LICENSE file. | |
package main | |
import "fmt" | |
// Send the sequence 2, 3, 4, ... to channel 'ch'. | |
func generate(ch chan int) { |