-
Notifications
You must be signed in to change notification settings - Fork 12
Description
From the documentation:
We define the graph of the conflicting zone with overpasses as vertices and create an edge between two conflicting overpasses. To find the possible non-conflicting combinations in this graph is actually searching for maximal cliques in the complementary graph, for which we use the Bron-Kerbosch algorithm. #illustration click
we obtain thus groups of passes that are not conflicting in the time frame. The next step is to find the optimal list of non conflicting passes under the duration on the schedule.
There is probably supposed to be an illustration here rather than the text #illustration click, although even the source just says #illustration click, which I don't think is valid ReST, so I'm not sure what illustration what meant to be here.
pytroll-schedule/docs/about.rst
Line 38 in ce4b852
| #illustration click |