# Summary

## Hybrid Data Structure 

* 如何表达这个hybrid data structure
  * 注意的是根据每个element(key, value, index)所要储存的data structure来变形
* data structure的细节
  * 不sorted (queue? )
    \*
  * partial sorted(heap/ treeSet)
    * 可以帮助其中一个element找出最值
      * 需要的是map\<element, index>, container(element)
  * total sorted ((list/array, double-linkedlist))
    * linkedlist\<element>, map\<element, index>?

## Graph

* 如何表达图？element？ graph的样子
* 你到底解决什么问题？ reachable/ paths/ topological order/&#x20;
* dfs & bfs各个的细节

## DP

* 从dfs all paths 开始到 pure recursion
* 到dp，压缩空间&增加维度
* 别忘了bfs,


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://algo.younglimit.com/summary.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.