This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<title>Mandelbrot in JS + Canvas</title> | |
<meta charset="UTF-8"> | |
<style type="text/css"> | |
#centered { | |
margin-left: 35%; | |
margin-top: 10%; | |
width: 430px; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdexcept> | |
#include <iostream> | |
#include <cstdlib> | |
#include <ctime> | |
#include <sys/time.h> | |
using namespace std; | |
#define izquierda(nodo) (nodo+nodo+1) | |
#define derecha(nodo) (nodo+nodo+2) | |
#define padre(nodo) ((nodo-1)>>1) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <exception> | |
#include <cstdlib> | |
#include <iostream> | |
using namespace std; | |
class NodoInexistenteException : public exception { | |
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!doctype html> | |
<html> | |
<head> | |
<title>Canvas + JS</title> | |
<style> | |
#canvas { | |
border: 1px solid black; | |
} | |
</style> | |
</head> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <vector> | |
using namespace std; | |
#define INFINITO 1000000 | |
#define forn(i, n) for(i = 0; i < (n); ++i) | |
typedef vector<int> vint; | |
typedef vector<vint> vvint; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
location /media { | |
alias /home/flebron/sites/fedelebron.com/media; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
\section{Resumen de isomorfismos} | |
\begin{definition} Dados grafos $G = (V, E)$ y $G' = (V', E')$, se dice que $G$ y $G'$ son \emph{isomorfos} si existe una función $f: V \to V'$ biyectiva tal que $\forall \ u, v \in V, (u, v) \in E \iff (f(u), f(v)) \in E'$. Notamos $G \cong G'$, y decimos que $f$ es un \emph{isomorfismo de grafos}. | |
\end{definition} | |
\paragraph{} Intuitivamente, un isomorfismo de grafos preserva lo que es el grafo en sí. Sobre un grafo, generalmente, nos importan solo los ejes entre los nodos. No nos importan, por ejemplo, las etiquetas con las que nombremos a los nodos, ni la posición gráfica de los mismos, ni las curvas que usemos para dibujar los ejes, ni si llovía mientras lo dibujábamos. Un isomorfismo de grafos preserva la estructura que nos importa, la relación entre los nodos. Se deja como ejercicio ver que ``ser isomorfo'' es una relación de equivalencia. | |
\paragraph{} Como dijo Mariano, podemos pensar que cualquier propiedad que intentemos escribir usando sólo esta estructura del g |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function hashElements(arr, directions, order) { | |
var i = order.length, sort_pass = function(field, order) { | |
arr = arr.sort(function(a, b) { | |
var res = a[field] <= b[field]; | |
return b == -1? res : !res; | |
}); | |
}; | |
while(i--) sort_pass(order[i], directions[order[i]]); | |
return arr; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import ( | |
"flag" | |
"image" | |
"image/color" | |
"image/png" | |
"math" | |
"os" | |
) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import tempfile | |
import sys | |
import os | |
import hashlib | |
import shutil | |
import re | |
from subprocess import Popen, PIPE | |
pattern = re.compile(r'\$(.*?)\$') | |
pattern2 = re.compile(r'\[`(.*?)`\]', re.DOTALL) |
OlderNewer