Python to Delphi conversion of a bidirectional Graph Traversal algorithm.

Hi, I am a retired business man who likes programming in his spare time. Unfortunately I have Parkinson's disease which slows me down. I am planning to subcontract some of the programming I would have done myself previously. Don’t be worried about the algorithm itself. The work is conversion of an existing Python implementation into Delphi(pascal). Here is the code def _bidirectional_all_simple_paths(G, source, target, cutoff): if cutoff < 1: return tree = [{source:{(source,)}}, {target:{(target,)}}] # used if the graph is not directed neighbors = lambda modus, node: iter(G[node]) if G.is_directed(): neighbors = lambda modus, node: [login to view URL](node) if modus \ else [login to view URL](node) for _ in range(cutoff): modus = len(tree[1]) < len(tree[0]) tree_source = tree[modus] tree_target = tree[modus^1] temp_tree = dict() for leave, paths in [login to view URL](): for s in neighbors(modus, leave): for path_s in paths: if s not in path_s: if s in tree_target: for path_t in tree_target[s]: if not set(path_t).intersection(path_s): if modus: yield list(path_t + tuple(reversed(path_s))) else: yield list(path_s + tuple(reversed(path_t))) try: temp_tree[s].add(path_s + (s,)) except: temp_tree[s] = {path_s + (s,)} tree[modus] = temp_tree There is extensive documentation located here [login to view URL] I want to gain the speed of compiled code and vectorized operations from Delphi whilst maintaining the readability of Python. Apart from familiarity with Python and Delphi the best candidates for the work would have had some experience with a vector package for Delphi (eg MxVec) and a network package for Python (eg NetworkX). The key is data structure conversion of the efficient Python types into efficient Delphi types. For the right person the job would not take very long. I have attached a file with the full python source. It has extensive documentation. All bids considered. Paul