Skip to content

Instantly share code, notes, and snippets.

-module(queue_slow).
-export([main/0]).
main() ->
loop().
large_queue(0) -> queue:new();
large_queue(N) -> queue:in(N, large_queue(N-1)).
pop(Q) -> {A, B} = queue:out(Q), B.
@AlexErofeev
AlexErofeev / graph.h
Created December 10, 2012 20:19 — forked from IlyaKornakov/graph.h
Tarjan Subtree Decomposition
#ifndef GRAPH_H_
#define GRAPH_H_
#include <algorithm>
#include <cstdio>
#include <string>
#include <stdexcept>
namespace sp {
class Graph {