登录
首页 » 电子书 » windows程序开发教材

windows程序开发教材

于 2022-06-16 发布 文件大小:5.73 MB
0 134
下载积分: 2 下载次数: 1

代码说明:

windows程序开发教材-windows program materials

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • OllyDbg完全教程
    OllyDbg 完全教程-OllyDbg complete tutorial
    2022-01-26 02:37:22下载
    积分:1
  • This manual is aimed at the production of a certain web page design experience o...
    本手册针对的是已有一定网页设计制作经验的读者。其目的是提供完整清晰的样式表内容的快速索引及进阶帮助。所以对于网页制作和样式表的基础知识,仅简单介绍,恕不赘述。 -This manual is aimed at the production of a certain web page design experience of readers. Its purpose is to provide clear and complete style sheet content rapid indexing and advanced help. So for the page style sheet production and the basic knowledge, only a simple introduction, not to go into details.
    2022-01-26 02:46:14下载
    积分:1
  • 指针经验总结
    指针经验总结 -Pointer experience
    2022-05-07 11:24:56下载
    积分:1
  • 代码是,是java和XML的例
    code is example of ebook that is java and xml
    2022-03-03 23:55:43下载
    积分:1
  • 一个简单的mfc计算器,VC编写,适合初学者学习借鉴。
    一个简单的mfc计算器,VC编写,适合初学者学习借鉴。-Mfc a simple calculator, VC writing, for beginners to learn from.
    2022-06-21 23:03:21下载
    积分:1
  • 图论中最小生成树Kruskal算法 及画图程序 M
    图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W):n为图顶点数,W为图的带权邻接矩阵,不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]
    2022-01-30 21:32:39下载
    积分:1
  • It is on the vc++ the polymorphism data, there are polymorphisms of the contents...
    它是关于vc++的多态性的资料,里面有多态性的内容的介绍,还有一些多态性的例子-It is on the vc++ the polymorphism data, there are polymorphisms of the contents of the presentations, there are some examples of polymorphism
    2022-11-17 10:10:04下载
    积分:1
  • 微软认证考试的题目,对于大家要参加这项考试的人来说,那是相当有用。...
    微软认证考试的题目,对于大家要参加这项考试的人来说,那是相当有用。-Microsoft certification exam topics, for everyone to participate in the examination of people, it is quite useful.
    2022-08-14 17:11:42下载
    积分:1
  • BP神经网络在状态监测数据趋势预测中的应用,希望对大家有用...
    BP神经网络在状态监测数据趋势预测中的应用,希望对大家有用-BP monitoring network in the state trend data, the application you wish to useful
    2022-02-05 05:46:41下载
    积分:1
  • 基于遗传算法的力系统无功优化
    求解电力系统无功优化的c++代码。无功优化,就是当系统的结构参数及负荷情况给定时,通过对某些控制变量的优化,所能找到的在满足所有指定约束条件的前提下,使系统的某一个或多个性能指标达到最优时的无功调节手段。无功优化问题是从最优潮流的发展中逐渐分化出的一个分支问题。
    2022-01-25 22:57:41下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载