Antonio Cañada Momblant tonicanada

## tsp_medium_article_ortools.cs
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

## tsp_medium_article_approx_christofides.cs
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace TspCadPlugin
{
    public static class AproxChristofides
    {

## tsp_medium_article_approx_2t.cs
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace TspCadPlugin
{
    public static class AproxDoubleTree
    {

## tsp_medium_article_optimal_dp_part3.cs
using System;
using System.Collections.Generic;

namespace TspCadPlugin
{
    public static class OptimalTspDynProg
    {
        /// <summary>
        /// Function that computes the optimal TSP solution using Dynamic Programming.
        /// </summary>

## tsp_medium_article_optimal_dp_part2.cs
using System;
using System.Collections.Generic;
using System.Linq;

class Program
{

    public static double[,] distMatrix =
      {
      {0, 13, 17, 23},

## tsp_medium_article_optimal_dp_part1.cs
using System;
using System.Collections.Generic;
using System.Linq;

class Program
{

    public static double[,] distMatrix =
    {
      {0, 13, 17, 23},

## tsp_medium_article_optimal_ilp.cs
using System;
using System.Collections.Generic;
using System.Linq;
using Google.OrTools.LinearSolver;

namespace TspCadPlugin
{
    public static class OptimalTspIlp
    {
        /// <summary>

## maxflowproblem_ford_fulkerson.js
// 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],

## linearprogramming_maxflownetwork_ortools.cs
using System;
using Google.OrTools.LinearSolver;


// Max-flow algorithm example


// Capacities Graph Network (first row should correspond to S, last to T)
int[,] capacitiesGraph = new int[6, 6]
{

## statistics_causality_matching.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                tonicanada
                / statistics_causality_matching.ipynb
            
            
              Last active
              September 18, 2022 17:00
            
          
      View statistics_causality_matching.ipynb
  
    
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
	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
	// 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],
	using System;
	using Google.OrTools.LinearSolver;


	// Max-flow algorithm example


	// Capacities Graph Network (first row should correspond to S, last to T)
	int[,] capacitiesGraph = new int[6, 6]
	{