mrp algorithm

Today began to study the Redis source code some of the tools in the implementation of the tool class in any language, the implementation of the algorithm principle should be the same, so you can take this opportunity to learn some of the more classical algorithms. Like I see today. CRC cyclic redundancy check algorithm and rand random number generation algorithm.

1.The distance vector routing algorithm (Distance vector ROUTING,DV) is the first routing algorithm used on the ARPANET network, also known as Bellman-ford routing algorithm and Ford-fulkerson algorithm, mainly in RIP (route Information Protocol) protocol. Cisco's IGRP and EIGRP routing protocols are also using DV as a

Coincidentally, almost all of the popular hash map uses the DJB hash function, commonly known as "TIMES33" algorithm. Perl, Berkeley DB, Apache, MFC, STL, and so on. Times33 's algorithm is also very simple, is constantly multiply by 33. Nhash = nhash*33 + *key++; I didn't find any theory to illustrate the rationality of this algorithm, it is said that only

Kruskal algorithm and prim algorithm of minimum spanning treeDepending on the depth-first traversal and breadth-first traversal of the graph, all vertices can be connected with the fewest edges, and no loops are formed. This tree structure, which joins all vertices and the path is unique, is called a spanning tree or an extension tree. In practice, the weights and minimums of all sides of the spanning tree

First, merge Sort methodMerge sort is an efficient or relatively high algorithm. The divide-and-conquer approach is often used as a solution to this problem, and today's popular cloud computing is in fact a sort of application of the divide-and-conquer approach.The so-called division of the Law, the literal interpretation is "divide and conquer", is to divide a complex problem into two or many other similar or similar sub-problems, until the last sub-

K-Nearest-neighbor algorithm for machine learning (KNN algorithm) first, the conceptK-Nearest Neighbor algorithm is a simple machine learning method based on the distance between different eigenvalues. This paper simply introduces the next KNN algorithm and uses it to realize handwritten digit recognition. working pr

A * algorithm is a heuristic search algorithm. People who understand BFS, DFS, or Dijkstra algorithms should know that. These algorithms are a way of blindly searching around. Heuristic Search: Heuristic search is the search in the state space to evaluate the location of each search, get the best location, and then from this location to search until the target. This can omit a lot of fearless search path,

The dijkstra--of the halfway algorithm is understood from the angle of routing algorithm A previous Wireless sensor network course (WSN) assigned a Dijkstra algorithm to any language in any environment. I thought, good ah, had been shouting no time to worry about the algorithm, this can be used as a breakthrough point

There are also contacts for the program paging algorithm. In general, there are two kinds of paging algorithms, one is the traditional ADO paging, the other is the select top paging algorithm. For small data tables, such as ten thousand or twenty thousand of the amount of data table, I tend to use the ADO algorithm, for large data tables, you must adopt the latte

Learning the basics of algorithmic design and analysis, exercise 2.4 5th asks to design a non-recursive algorithm for Hanoi games.Think, not the solution. After reading the answer tips:If you can't, don't be depressed: the non-recursive algorithm of this problem is not complicated, but it is not easy to find. As a consolation, you can find answers on the internet.Well, the words are so straightforward, so B

On the extended Euclidean algorithm (Extended Euclidean algorithm), I was working on the classic topic of frog dating to get access to this algorithm. There is also an AC code and a solution to the problem.Content: Known A, B, solves a set of X, Y, and satisfies the Bézout equation: Ax+by =gcd (A, B)Extending Euclid's algorit