Refactored for a flat buffer friendly, and O(1) or O(n) time complexities.

documentation/html/navtreeindex0.js

@@ -0,0 +1,20 @@
+var NAVTREEINDEX0 =
+{
+"annotated.html":[1,0],
+"class_graph.html":[1,0,1],
+"class_graph.html#a230f67d1097f0a88f1cded9be1040ce9":[1,0,1,0],
+"class_graph.html#a61af63f3d00e297e91772b482de3dc74":[1,0,1,2],
+"class_graph.html#a81382d6a8dffca97d8e3c8e00faf7cf6":[1,0,1,4],
+"class_graph.html#a902c5b3eacb66d60752525ab23297a95":[1,0,1,1],
+"class_graph.html#af96ec89a386c4b1f8e74619bc7b028cc":[1,0,1,3],
+"classes.html":[1,1],
+"files.html":[2,0],
+"functions.html":[1,2,0],
+"functions_func.html":[1,2,1],
+"graph_8h_source.html":[2,0,0],
+"index.html":[],
+"md__r_e_a_d_m_e.html":[0],
+"pages.html":[],
+"struct_edge.html":[1,0,0],
+"struct_point.html":[1,0,2]
+};