← 返回起始笔记位置

知识卡片

普通读书笔记卡 · 3639

动态图结构支持边点变化

理解等级:初级

动态图数据结构允许插入或删除顶点、边,同时支持图查询。

原文列举点连通性、边连通性、最小生成树、双连通性与传递闭包;本段没有给出统一操作时间界,具体代价须按更新和查询种类判断。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第五部分 高级数据结构 · 查看原书依据

      Dynamic graph data structures support various queries while allowing the structure of a graph to change through operations that insert or delete vertices or edges. Examples of the queries that they support include vertex connectivity [214], edge connectivity, minimum spanning trees [213], biconnectivity, and transitive closure

    参考来源

    - 位置:《算法导论(第4版)》第五部分引言《高级数据结构》(OEBPS/part005.xhtml,文本字符[5000,5485))。 - 结论依据:原文明确允许顶点或边的增删,并逐项列出支持的图查询示例,未给统一复杂度。 - 原始内容:Dynamic graph data structures support various queries while allowing the structure of a graph to change through operations that insert or delete vertices or edges. Examples of the queries that they support include vertex connectivity [ 214 ], edge connectivity, minimum spanning trees [ 213 ], biconnectivity, and transitive closure