christofides(G, weight='weight', tree=None)
Compute a 3/2-approximation of the traveling salesman problem in a complete undirected graph using Christofides algorithm.
G should be a complete weighted undirected graph. The distance between all pairs of nodes should be included.
Edge data key corresponding to the edge weight. If any edge does not have this attribute the weight is set to 1.
A minimum spanning tree of G. Or, if None, the minimum spanning tree is computed using networkx.minimum_spanning_tree
List of nodes in G along a cycle with a 3/2-approximation of the minimal Hamiltonian cycle.
Approximate a solution of the traveling salesman problem
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them