I need a Clark and Wright Savings Algorithm in Python. Are there any templates already?

I have the following distance matrix given:

[0, 10, 5, 9999, 9999, 9999, 9999],

[10, 0, 5, 15, 20, 9999, 9999],

[5, 5, 0, 10, 9999, 9999, 9999],

[9999, 15, 10, 0, 15, 20, 15],

[9999, 20, 9999, 15, 0, 5, 9999],

[9999, 9999, 9999, 20, 5, 0, 20],

[9999, 9999, 9999, 15, 9999, 20, 0]