yuvipanda

yuvipanda

yuvipanda

# Once started, you can use this to build your docker images with:
#
# kubectl -n <namespace> port-forward deployment/dind 23760:2376
# export DOCKER_HOST=tcp://localhost:23760
#
# After that, all docker commands & similar will talk to this docker instance on kubernetes!
apiVersion: apps/v1
kind: Deployment
metadata:
  name: dind

yuvipanda

RetroLab 0.3.0a2 on Binder

yuvipanda

#include <stdio.h>

#define PAGE_SIZE 100
#define PAGE_TABLE_SIZE 128

struct pentry
{
  int no;
  int start_addr;
} ptable[PAGE_TABLE_SIZE];

yuvipanda

The line graph of a graph G is a graph having the edges of G as it's nodes and edges between them if the corresponding edges in G are adjacent. The Hamiltonian Completion Number is the minimum number of edges to be added to a graph for it to have a Hamiltonian Cycle.

Formally, the problem can be stated as asking for the Hamiltonian Completion Number of the line graph of a tree. While this problem is NP-Complete for the general case, it is in fact solvable in polynomial (linear actually) time for trees. Again, I do not have a simple algorithm, or a proof of why the algorithm works. Feel free to look at solutions or read up more about the problem online. See: http://en.wikipedia.org/wiki/Hamiltonian_completion http://www.sciencedirect.com/science/article/pii/S0020019000001642

Note that the caterpiller trees discussed above are precisely the trees for which the Hamiltonian Completion Number of their line graphs is 0.

yuvipanda

yuvipanda

tmux
vim
emacs
screen
byobu

yuvipanda

yuvipanda@a7a946db6422:~$ cat /tmp/jupyterlab-debug-m5il2z3b.log 
Yarn configuration loaded.
> /usr/bin/npm pack /home/yuvipanda

> jupyter-videochat@0.1.0 prepare /home/yuvipanda
> jlpm run clean && jlpm run build

yarn run v1.21.1
$ jlpm run clean:lib
$ rimraf lib tsconfig.tsbuildinfo

yuvipanda