all distances

#! /usr/bin/env python3

import sys

import time

import random as rand

import Levenshtein as leven

			min_c = min(min_c, self.cost_rate())

		return min_c

	def all_distances(self):

		ad = dict()

		for i, w in enumerate(self.l):

			before = time.time()

			for v in self.l[i:]:

				if w not in ad:

					ad[w] = dict()

				ad[w][v] = self.distance(w, v)

			after = time.time()

			print(w, after-before)

if __name__ == '__main__':

	R = Robustness(sys.argv[1])

	R.all_distances()

	exit()

	R.k = int(len(R.l)/5)

	print(R.min_rperm(n=10))

 No newline at end of file