Mercurial Hosting > traffic-intelligence
comparison trafficintelligence/moving.py @ 1133:c4d9c270f999
modification for performance computation
author | Nicolas Saunier <nicolas.saunier@polymtl.ca> |
---|---|
date | Wed, 26 Feb 2020 22:39:36 -0500 |
parents | 09ef0dc994a0 |
children | 4b2a55d570c1 |
comparison
equal
deleted
inserted
replaced
1132:09ef0dc994a0 | 1133:c4d9c270f999 |
---|---|
2032 unmatchedTOs = [o for o in objects if o.existsAtInstant(t) and o not in matchedTOs] | 2032 unmatchedTOs = [o for o in objects if o.existsAtInstant(t) and o not in matchedTOs] |
2033 nGTs = len(matchedGTs)+len(unmatchedGTs) | 2033 nGTs = len(matchedGTs)+len(unmatchedGTs) |
2034 nTOs = len(matchedTOs)+len(unmatchedTOs) | 2034 nTOs = len(matchedTOs)+len(unmatchedTOs) |
2035 if len(unmatchedTOs) > 0: | 2035 if len(unmatchedTOs) > 0: |
2036 for a in unmatchedGTs: | 2036 for a in unmatchedGTs: |
2037 costs.append([a.matches(o, t, matchingDistance) for o in unmatchedTOs]) | 2037 costs.append([a.motDistanceAtInstant(o, t) for o in unmatchedTOs]) |
2038 if len(costs) > 0: | 2038 if len(costs) > 0: |
2039 newMatches = munk.compute(costs) | 2039 newMatches = munk.compute(costs) |
2040 for k,v in newMatches: | 2040 for k,v in newMatches: |
2041 if costs[k][v] < matchingDistance: | 2041 if costs[k][v] < matchingDistance: |
2042 matches[unmatchedGTs[k]]=unmatchedTOs[v] | 2042 matches[unmatchedGTs[k]]=unmatchedTOs[v] |