Fun graph theory problem for you guys: IN an ordered data

Question

Fun graph theory problem for you guys: IN an ordered data

structure where elements are sorted in a specific arbitrary order that is NOT the order of insertion, how do you iterate through the data in the order of insertion? Rather, how do you efficiently store order information?

0

27.07.2017

3 ответов

13 просмотров

Dani Автор вопроса

Looking at how Boost does it http://www.boost.org/doc/libs/1_64_0/libs/multi_index/doc/tutorial/basics.html#multiple_sort

0

27.07.2017

Robin de Jong

The insertion also keeps a linked list. Which is O(1)

0

27.07.2017

Thomas · Accepted Answer

Thomas

Kek, I doubt anyone in this group is better than you in graph theory

0

27.07.2017

Похожие чаты

Fun graph theory problem for you guys: IN an ordered data

3 ответов

Похожие вопросы