{"version":1,"pages":[{"id":"yqsFR8DB4jOR0U8PXCtl","title":"The Algorithms Interest Group","pathname":"/","siteSpaceId":"sitesp_yS7WV","description":"Introduction"},{"id":"I7hxzk6xg91vP4NbJ9sc","title":"GCC Compiler","pathname":"/the-c++-programming-language/gcc-compiler","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"The C++ Programming Language"}]},{"id":"m1LClXEJg5xRUdnJ7zBr","title":"Fundamental","pathname":"/the-c++-programming-language/fundamental","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"The C++ Programming Language"}]},{"id":"EuzTeWpcxlvjiaFqRvxf","title":"Integrated Environment","pathname":"/the-c++-programming-language/integrated-environment","siteSpaceId":"sitesp_yS7WV","description":"Integrated Environment for C++ development","breadcrumbs":[{"label":"The C++ Programming Language"}]},{"id":"VDHtU32gWwtphSWe36zl","title":"STL Containers","pathname":"/the-c++-programming-language/stl-containers","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"The C++ Programming Language"}]},{"id":"s2tpWBiudkT3eyPYpzSD","title":"Greedy","pathname":"/fundamental/ch1-greedy","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Fundamental Algorithms and Data Structures"}]},{"id":"SoC6FSgXJmRN7ukWGGJY","title":"Greedy (2022)","pathname":"/fundamental/greedy-2022","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Fundamental Algorithms and Data Structures"}]},{"id":"Gg8Yrh6rlA6qZkGJjed6","title":"Binary Search","pathname":"/fundamental/ch1-binary-search","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Fundamental Algorithms and Data Structures"}]},{"id":"lPFkEUtFHBtN9KFFDciL","title":"Recursion","pathname":"/fundamental/ch1-recursion","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Fundamental Algorithms and Data Structures"}]},{"id":"i2yaDT9HT3KtZwGYHUBB","title":"Linear Structure","pathname":"/fundamental/ch1-linear-structure","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Fundamental Algorithms and Data Structures"}]},{"id":"Jzd7IrsULV4C4LU14uLV","title":"Generic Tree","pathname":"/fundamental/ch1-generic-tree","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Fundamental Algorithms and Data Structures"}]},{"id":"Q5Hcg4FQalnvUmEGwuLu","title":"Generic Graph","pathname":"/graph-theory/ch1-generic-graph","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Graph Theory"}]},{"id":"BKOCqhlrXfEICG6NRKPL","title":"Minimum Spanning Tree","pathname":"/graph-theory/ch2-minimum-spanning-tree","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Graph Theory"}]},{"id":"kqSDjdP7SKyZAkhpCwfp","title":"Depth First Search","pathname":"/graph-theory/ch2-depth-first-search","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Graph Theory"}]},{"id":"vK6aZ2bzRnO6uvgH9d9y","title":"Breadth First Search","pathname":"/graph-theory/ch2-breadth-first-search","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Graph Theory"}]},{"id":"mdFUAc3edzju6x1xirT0","title":"Shortest Path","pathname":"/graph-theory/ch2-shortest-path","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Graph Theory"}]},{"id":"CbUvEpped5DipFOP1DM5","title":"Network Flow","pathname":"/graph-theory/network-flow","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Graph Theory"}]},{"id":"hanBtlNk9V0g2R790Jod","title":"Bipartite Graph","pathname":"/graph-theory/bipartite-graph","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Graph Theory"}]},{"id":"9zrK25IgBfLXfTEdHnsx","title":"Topological Sort","pathname":"/graph-theory/topological-sort","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Graph Theory"}]},{"id":"MjMVQ1dX3NrN26R2JAwf","title":"Automaton","pathname":"/graph-theory/automaton","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Graph Theory"}]},{"id":"fKUf1QUY56tM7btFtl6h","title":"Basic Dynamic Programming","pathname":"/dynamic-programming/basic-dynamic-programming","siteSpaceId":"sitesp_yS7WV","description":"","breadcrumbs":[{"label":"Dynamic Programming"}]}]}