Skip to content

Instantly share code, notes, and snippets.

View tonicanada's full-sized avatar

Antonio Cañada Momblant tonicanada

View GitHub Profile
@tonicanada
tonicanada / bank_conversion.py
Last active April 5, 2023 02:58
Ejemplo de uso de la librería pip `conversor_nominas_bancos_chile`
from conversor_nominas_bancos_chile import bank_functions
import pkg_resources
import json
from pathlib import Path
import pandas as pd
# _________________________________________________________________________________________________________
@tonicanada
tonicanada / eda-template.ipynb
Created February 8, 2023 03:03
EDA Template.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using Google.OrTools.ConstraintSolver;
namespace TspCadPlugin
{
public static class OrToolsTSP
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace TspCadPlugin
{
public static class AproxChristofides
{
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace TspCadPlugin
{
public static class AproxDoubleTree
{
using System;
using System.Collections.Generic;
namespace TspCadPlugin
{
public static class OptimalTspDynProg
{
/// <summary>
/// Function that computes the optimal TSP solution using Dynamic Programming.
/// </summary>
using System;
using System.Collections.Generic;
using System.Linq;
class Program
{
public static double[,] distMatrix =
{
{0, 13, 17, 23},
using System;
using System.Collections.Generic;
using System.Linq;
class Program
{
public static double[,] distMatrix =
{
{0, 13, 17, 23},
using System;
using System.Collections.Generic;
using System.Linq;
using Google.OrTools.LinearSolver;
namespace TspCadPlugin
{
public static class OptimalTspIlp
{
/// <summary>
// Ford-Fulkerson algorithm implementation to solve Max Network Flow
// capacitiesGraph graph network
// https://graphonline.ru/en/?graph=lfhEQWkIEqiJCKvH
const capacitiesGraph = [
[0, 18, 0, 15, 0, 0],
[0, 0, 9, 2, 10, 0],
[0, 0, 0, 0, 0, 13],
[0, 0, 0, 0, 3, 0],