资源列表
[Windows编程] Depth-First-Search
说明:Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.<ww> 在 2025-10-14 上传 | 大小:1kb | 下载:0
[单片机(51,AVR,MSP430等)] Arirang-k600-{ic-8202r}.bin
说明:rom dvd en25t80-5-rom dvd en25t80-5888<minh> 在 2025-10-14 上传 | 大小:843kb | 下载:0
[行业应用软件] AWT_Project
说明:用java AWT包和swing插件编写的商品销售管理系统,有数据的增删改和查询,链接SQLSever2005数据库。假面很好看-Swing with the java AWT package and plug-ins written in merchandising management system, there are additions and deletions to and query the data, links SQLSever2005 database. Mask looks<小龙> 在 2025-10-14 上传 | 大小:61kb | 下载:0
[数值算法/人工智能] Warshalls-Transitive-Closure
说明:In computer science, the Floyd–Warshall algorithm (also known as Floyd s algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm[clarification needed]) is a graph analysis algorithm for finding shortest paths in a weighted graph<ww> 在 2025-10-14 上传 | 大小:1kb | 下载:0
[数值算法/人工智能] Bellman-Fords-Shortest-Paths
说明:The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph. For graphs with only non-negative edge weights, the faster Dijkstra s algorithm also solves the problem.<ww> 在 2025-10-14 上传 | 大小:1kb | 下载:0
[图形图像处理(光照,映射..)] jieping
说明:截屏 进行指定位置图像截取,可以自定义起始位置,像素-failed to translate<riche> 在 2025-10-14 上传 | 大小:2kb | 下载:0
[matlab例程] calculate_LCTD4
说明:L类四阶复延迟时频分布程序,可用来做仿真信号的时频分布-L class of fourth order delay time-frequency distribution of complex procedures, can be used for simulation of time-frequency distribution<刘震宇> 在 2025-10-14 上传 | 大小:2kb | 下载:0
[数学计算/工程计算] HeapSort
说明:Heapsort is a comparison-based sorting algorithm, and is part of the selection sort family. Although somewhat slower in practice on most machines than a well implemented quicksort, it has the advantage of a more favorable worst-case O(n log n) runtim<ww> 在 2025-10-14 上传 | 大小:1kb | 下载:0