A valid solution to a matchmaking problem.
Name | Type | Description | Notes |
---|---|---|---|
id | String | [optional] | |
costs | Double | [optional] | |
time | Float | [optional] | |
isOptimal | Boolean | [optional] | |
valid | Boolean | [optional] | |
nodeCandidates | List<NodeCandidate> | [optional] |