Jasper2003 - 博客园

2020年11月16日

摘要： 1. Often there are multiple shortest paths between two nodes of a graph. Give a linear-time algorithm for the following task. Input: A undirected grap 阅读全文

posted @ 2020-11-16 11:11 Jasper2003 阅读(400) 评论(0) 推荐(0)

ALG 3-6: Directed Acyclic Graphs and Topological Ordering (有向无环图与拓扑排序)

摘要： Directed Acyclic Graphs Def. An Directed Acyclic Graphs is a directed graph that contains no directed cycles. （有向无环图是一种不包含有向环的有向图。）Ex. Precedence cons 阅读全文

posted @ 2020-11-16 09:33 Jasper2003 阅读(216) 评论(0) 推荐(0)

2020年11月15日

ALG 3-5: Connectivity in Directed Graphs (有向图的连接性)

摘要： Directed Graphs Directed graph. G = (V, E) Edge (u, v) goes from node u to node v. Ex. Web graph -hyperlink points from one web page to another. （网络图— 阅读全文

posted @ 2020-11-15 09:12 Jasper2003 阅读(191) 评论(0) 推荐(0)

ALG 3-4: Testing Bipartiteness - An Application of BFS

摘要： Bipartite Graphs Def. An undirected graph G = (V, E) is bipartiteif the nodes can be colored red or blue such that every edge has one red and one blue 阅读全文

posted @ 2020-11-15 07:50 Jasper2003 阅读(244) 评论(0) 推荐(0)

ALG 3-2: Graph Connectivity & Graph Traversal (BFS)

摘要： Connectivity s-t connectivity problem. Given two node s and t, is there a path between s and t? (s - t连接问题: 给定两个节点s和t，在s和t之间有路径吗?) s-t shortest path p 阅读全文

posted @ 2020-11-15 06:42 Jasper2003 阅读(128) 评论(0) 推荐(0)

2020年11月14日

ALG 3-1: Graph - Basic Definitions and Applications (图 - 基本定义与应用)

摘要： Undirected Graphs （无向图） G = (V, E) V = nodes. E = edges between pairs of nodes. Captures pairwise relationship between objects. （捕获对象之间的成对关系） Graph si 阅读全文

posted @ 2020-11-14 23:49 Jasper2003 阅读(164) 评论(0) 推荐(0)

ALG 2-n: Practice

摘要： Question 1: Solution: Question 2: Solution: Question 3: Solution: Other questons: <1> Chapter 2: 3, 4, 8 <2> Chapter 2: Sections 2.1, 2.2, 2.4 阅读全文

posted @ 2020-11-14 09:43 Jasper2003 阅读(119) 评论(0) 推荐(0)

ALG 2-4: A Survey of Common Running Times (对常见运行时间的分析)

摘要： Linear Time: O(n) Linear time. Running time is proportional to input size. （线性时间: 运行时间与输入大小成正比） <1>Computing the maximum. Compute maximum of n numbers 阅读全文

posted @ 2020-11-14 08:58 Jasper2003 阅读(231) 评论(0) 推荐(0)

ALG 2-2: Asymptotic Order of Growth (渐进分析)

摘要： 1. Asymptotic Order of Growth Upper bounds. T(n) is O(f(n)) if there exist constants c > 0 and n0 ≥ 0 such that for all n ≥ n0 we have T(n) ≤c · f(n). 阅读全文

posted @ 2020-11-14 07:37 Jasper2003 阅读(389) 评论(0) 推荐(0)

ALG 2-1: Computational Tractability (计算复杂性理论)

摘要： 1. 简介在计算理论中；有一种理论称作‘计算复杂性理论’（computational complexity theory ）,专门研究计算问题时所需的资源，比如时间和空间，以及如何尽可能地节省这些资源。 2. Polynomial-Time Brute force. For many non-tr 阅读全文

posted @ 2020-11-14 07:04 Jasper2003 阅读(672) 评论(0) 推荐(0)

Mr.Meeseeks

公告