Skip to main content

Christofides Algorithm for TSP.

Project description

This package(Christofides) provides a way to implement Christofides algorithm for solving Travelling Saleman Problem(TSP) to obtain an approximate solution on an undirected graph(Distance Matrix) provided as an upper Triangular matrix. The Distance from a node on to itself is assumed 0.


Use the compute() function which takes as input a distance_matrix and returns a Christofides solution as follows:

from Christofides import christofides
TSP = christofides.compute(distance_matrix)


import Christofides
TSP = Christofides.christofides.compute(distance_matrix)

The Distance Matrix is an upper Triangular matrix with distance from a node on to itself 0, since Christofides algorithm could only be applied for undirected graphs. Also the distance between a node on to itself is practically 0. Example for distance_matrix is as follows, distance_matrix =


The above distance_matrix should be provided as an input to christofides.compute(), when we want to calculate TSP for distance =

christofides.compute(distance_matrix) returns a Dictionary with following Keys:

Christofides_Solution, Travel_Cost, MST, Odd_Vertices Indexes, Multigraph, Euler_Tour

  • Christofides_Solution: A list consisting of approximate tour for TSP.

    Use: TSP[‘Chistofides_Solution’]

  • Travel_Cost: The cost of TSP tour generated.

    Use: TSP[‘Travel_Cost’]

  • MST: The minimum spanning tree generated during the Christofides algorithm.

    Use: TSP[‘MST’]

  • Odd_Vertices: A list of odd vertices of minimum spanning tree.

    Use: TSP[‘Odd_Vertices’]

  • Indexes: List of edges from minimum cost perfect matching of odd vertices.

    Use: TSP[‘Indexes’]

  • Multigraph: Edges of multigraph formed after Indexing.

    Use: TSP[‘Multigraph’]

  • Euler_Tour: The Euler Tour of the Multigraph.

    Use: TSP[‘Euler_Tour’]

Support Functions in christofides

  • _csr_gen_triples(csr_matrix)

  • _odd_vertices_of_MST(distance_matrix, number_of_nodes)

  • min_Munkres(distance_matrix, bipartitie_graphs)

  • Munkres_cost(indexes, bipartite_graph)

  • bipartite_Graph(distance_matrix, bipartite_set, odd_vertices)

  • create_Multigraph(distance_matrix, MST, indexes, odd_vertices)

  • Euler_Tour(multigraph)

  • shortcut_Euler_Tour(tour)

  • cost(christofides_tour, distance_matrix)


python install

Additional Packages

scipy, numpy, networkx, munkres

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

Christofides-1.0.1.tar.gz (5.8 kB view hashes)

Uploaded Source

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page