Hello!
Now in graph's BFS there's not optimal linear complexity of poping the first element of a list instead of using deque (near constant time complexity of popleft).
You can see on image performance of an old one (blue) and new one (red): <img alt="deqlist.png" src="/freeipa/issue/raw/44530e6a1949921db08315be9be8c983e5d89f5fe78b74b96e00aa3a35ce96e3-deqlist.png" />
Please see code here: https://github.com/freeipa/freeipa/pull/905
Metadata Update from @tkrizek: - Issue priority set to: minor - Issue set to the milestone: FreeIPA 4.6
master:
Metadata Update from @tkrizek: - Issue close_status updated to: fixed - Issue status updated to: Closed (was: Open)
Please ignore the commits above, I accidentally pushed the code into a mirror repo instead of upstream. Sorry about that.
Metadata Update from @tkrizek: - Issue status updated to: Open (was: Closed)
Login to comment on this ticket.