围城个人博客

人丑就要多读书


  • 首页

  • 分类

  • 关于

  • 归档

  • 标签

  • menu.projects

My First Web Crawler

发表于 2016-07-11   |   分类于 Informal-Essay   |  
TargetGet all the titles and urls of my blogs. Design Firstly, the Crawler needs one controller(WebCrawler) to scheme the itself.The controller sends the root url to the urlManager.Then judges whether there is any url in the set.If the set is not empty, Crawler pops one from the set.Crawler download ...
阅读全文 »

Generating Function With Constrains

发表于 2016-05-17   |   分类于 Algorithm   |  
ProblemThere are five kinds of coins, valuing 1, 5, 10, 25, 50.Given a integer and use these five kinds of coins to conbine.Each kind of coins is infinit but the sum of coins to sum up the integer mustn’t exceeding 100.Futhermore, the given integer is smaller than 250.The question is that how many m ...
阅读全文 »

Generating Function Implements:Credits Combination

发表于 2016-05-17   |   分类于 Algorithm   |  
ProblemStatistics the number of conbination that can achieve n credits. Input FormalThe first line includes one integer represents the number of cases;The first line in each case has two integers n, k, n represents the total credits you will learn and k represents the courses you can choose.Assuming ...
阅读全文 »

Generating Function

发表于 2016-05-15   |   分类于 Algorithm   |  
A generating function describes an infinite sequence of numbers (An) by treating them as the coefficients of a series expansion.For example, the generating function of sequence {0,1,2,3,4,5…n} is g(x)=0+x+2x^2+3x^3+4x^4+…+nx^n. ApplicationsCondition:There are four weights weigh 1g, 2g, 3g, 4g.Questi ...
阅读全文 »

Maximum Independent Set

发表于 2016-05-07   |   分类于 Algorithm   |  
This case is an implements of Hungarian Algorithm.The module of the problem is maximum independent number = vertexs - maximum matching. BackgroundThe second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined ...
阅读全文 »

Properties of Bipartite Graph

发表于 2016-05-07   |   分类于 Algorithm   |  
Basic KnowledgeVertex CoveringVertex Covering:A vertex set and every edge has more one terminal in the set.Minimal Vertex Covering:A vertex covering and its any proper subset isn’t a vertex covering.Minimum Vertex Covering:A vertex covering who has the minimum vertex.Vertex Covering Number:The numbe ...
阅读全文 »

Bipartite Graph Maximum Matching

发表于 2016-05-07   |   分类于 Algorithm   |  
In this morning, my roommate H’s female friend asked him for help.Through my analysis, the girl was taking an examination… .What terrible means the girl was using!The girl begged my roommate H to help her to pass the examination and show how important the examination is to her constantly.But my room ...
阅读全文 »

Shortest Path Algorithm:SPFA

发表于 2016-05-03   |   分类于 Algorithm   |  
The background is the same as “Shortest Path Algorithm:SPFA” which I compose.I think the story I compose is very vivid, hhhhhhha_ SPFASPFA is the abbreviation of Shortest Path First Algorithm.It can deal with graph with negative weight.But when there is a negative circle in graph, SPFA will be incom ...
阅读全文 »
1234…7
围城

围城

Java|Python|CC++

52 日志
9 分类
84 标签
RSS
GitHub Weibo Zhihu
友情链接
  • XiaoWei
  • 阿尔卑斯君
© 2014 - 2018 围城