Sergio Botero sergiobuj

## gist:8962775
{
 "metadata": {
  "name": "clusterpy loves matplotlib"
 },
 "nbformat": 2,
 "worksheets": [
  {
   "cells": [
    {
     "cell_type": "code",

## 0_loading_shapes_with_clusterpy.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                sergiobuj
                / 0_loading_shapes_with_clusterpy.ipynb
            
            
              Last active
              August 29, 2015 13:56
            
              
                Clusterpy usage: 0 Loading and exploring shapes (http://nbviewer.ipython.org/gist/sergiobuj/9159111)
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## README.md

      
              2 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                sergiobuj
                / README.md
            
            
              Last active
              August 29, 2015 14:01
            
              
                Working vagrant base box with python dev tools included.
              
          
    Create custom Vagrant base boxes

About ipyvmbase:


Debian 7.5
build-essentials and git
ipython notebook
numpy
scipy
matplotlib
pandas


## clusterpysal.ipynb

      
              2 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                sergiobuj
                / clusterpysal.ipynb
            
            
              Last active
              August 29, 2015 14:02
            
              
                What if we could use [the amazing] Clusterpy on top of Pysal?
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## solution_for_gs.py
## Tarjan implementation from Wikipedia's pseudocode
def tarjan(graph):
    #input: graph G = (V, E)
    #output: set of strongly connected components (sets of vertices)
    n = len(graph)
    sccs = []
    index = [0]
    indexes = [-1] * n
    lows = [float('Inf')] * n
    S = []

## even_tree.cc
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
using namespace std;

## distance.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                sergiobuj
                / distance.ipynb
            
            
              Created
              May 20, 2015 05:36
            
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## Palindromize
Palidromized topcoder


  string minAdds(string s) {
    string res,a,b,aux;
    a=s;b=s;
    aux=s;
    reverse(aux.begin(),aux.end());
    if(s == aux)
      return s;

## TopCoder emacs tc cc func

;; TopCoder .cc compile function. (When using .cpp change -3 -> -4 -two times-)
(defun tc () (interactive)
  (compile (concat "g++ " (buffer-name)" -Wall -g -o "(substring (buffer-name) 0 -3)" && ./"(substring (buffer-name) 0 -3)))
  )

## CC
// Sergio Botero
// Status:
#include <cstdio>
#include <string>

int main (){

  while( 1 ){
    for(int i = 0; i < 25; usleep(30000), printf("%s+%s+%s\r", std::string(i++, ' ').c_str(), std::string( 50-(2*i)  , ' ').c_str(), std::string(i, ' ').c_str())) fflush(stdout);
    for(int i = 25; i >= 0; usleep(30000), printf("%s+%s+%s\r", std::string(i--, ' ').c_str(), std::string( 50-(2*i)  , ' ').c_str(), std::string(i, ' ').c_str())) fflush(stdout);
	{
	"metadata": {
	"name": "clusterpy loves matplotlib"
	},
	"nbformat": 2,
	"worksheets": [
	{
	"cells": [
	{
	"cell_type": "code",
	## Tarjan implementation from Wikipedia's pseudocode
	def tarjan(graph):
	#input: graph G = (V, E)
	#output: set of strongly connected components (sets of vertices)
	n = len(graph)
	sccs = []
	index = [0]
	indexes = [-1] * n
	lows = [float('Inf')] * n
	S = []
	#include <cmath>
	#include <cstdio>
	#include <vector>
	#include <iostream>
	#include <algorithm>
	#include <set>
	#include <map>
	#include <queue>
	using namespace std;
	Palidromized topcoder


	string minAdds(string s) {
	string res,a,b,aux;
	a=s;b=s;
	aux=s;
	reverse(aux.begin(),aux.end());
	if(s == aux)
	return s;

	;; TopCoder .cc compile function. (When using .cpp change -3 -> -4 -two times-)
	(defun tc () (interactive)
	(compile (concat "g++ " (buffer-name)" -Wall -g -o "(substring (buffer-name) 0 -3)" && ./"(substring (buffer-name) 0 -3)))
	)
	// Sergio Botero
	// Status:
	#include <cstdio>
	#include <string>

	int main (){

	while( 1 ){
	for(int i = 0; i < 25; usleep(30000), printf("%s+%s+%s\r", std::string(i++, ' ').c_str(), std::string( 50-(2*i) , ' ').c_str(), std::string(i, ' ').c_str())) fflush(stdout);
	for(int i = 25; i >= 0; usleep(30000), printf("%s+%s+%s\r", std::string(i--, ' ').c_str(), std::string( 50-(2*i) , ' ').c_str(), std::string(i, ' ').c_str())) fflush(stdout);