Upload Code
loading-left
loading loading loading
loading-right

Loading

Profile
No self-introduction
codes (2)
TSP c++
no vote
Traveling salesman problem (TSP) is also translated into traveling salesman problem and traveling salesman problem, which is one of the famous problems in the field of mathematics. Suppose there is a traveler who wants to visit n cities, he must choose the path he wants to take. The limit of the path is that each city can only visit once, and finally return to the original city. The goal of path selection is that the required path distance is the minimum of all paths.
xiaomujiangha
2017-03-25
0
1
Memory management experiment C++
no vote
According to the request paging management mechanism of virtual memory management, the page table structure is designed to simulate the conversion from logical address to physical address in virtual memory management. According to the first in first out page elimination algorithm, the missing page interrupt processing and page replacement are simulated, and the process of execution and replacement is output.
xiaomujiangha
2016-12-08
0
1
No more~