登录
首页 » 电子书 » 真正完整的<<DirectShow开发指南>>源码和书(超星格式), 请解压DirectShow_Code_Book_pdg1.rar,...

真正完整的<<DirectShow开发指南>>源码和书(超星格式), 请解压DirectShow_Code_Book_pdg1.rar,...

于 2022-02-05 发布 文件大小:5.99 MB
0 110
下载积分: 2 下载次数: 1

代码说明:

真正完整的源码和书(超星格式), 请解压DirectShow_Code_Book_pdg1.rar,DirectShow_Code_Book_pdg2.rar,DirectShow_Code_Book_pdg3.rar,DirectShow_Code_Book_pdg4.rar,DirectShow_Code_Book_pdg5.rar 到同一个目录.-real integrity

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

发表评论

0 个回复

  • 51单片机的使用经验,很有用,可以供大家学习
    51单片机的使用经验,很有用,可以供大家学习-51 SCM experience, very useful, can be used for them to learn! ! !
    2022-01-23 11:19:37下载
    积分:1
  • 华为公司内部 培训资料 模似
    华为公司内部 电子培训资料 模似电子-Huawei internal e-training materials simulation electronic
    2022-03-18 21:45:32下载
    积分:1
  • 深入浅出Windows MFC程序设计,对MFC初学者有很大帮助
    深入浅出Windows MFC程序设计,对MFC初学者有很大帮助-Explain the profound theory for Windows MFC design program in simple terms , help to MFC this book is of value greatly to benbeginner ..
    2023-03-06 11:10:08下载
    积分:1
  • 用风险投资编写的图形工具
    Graph tools written in vc-Graph tools written in vc++...
    2022-01-26 07:44:35下载
    积分:1
  • c语言开发的模拟撞球游戏,c语言开发的模拟撞球游戏
    c语言开发的模拟撞球游戏,c语言开发的模拟撞球游戏-c language development of the simulation pool game, c language development of the simulation pool game
    2022-04-18 08:59:46下载
    积分:1
  • VB程序员开发指南,从入门到精通,请用华康阅读器打开
    Socket通信的实现,聊天程序例子,包括客户端和服务器段,充分体现了socket 通信的功能-Socket Communications realization example chat program, including client and server segment, fully reflects the socket communication functions
    2022-03-04 14:36:58下载
    积分:1
  • 学习
    Learning-GNU-C.pdf 学写gnu c的资料,希望给兄弟们带来帮助!-Learning- GNU-C.pdf learn to write gnu c information, hope to help bring brothers!
    2022-04-23 17:46:14下载
    积分: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
  • vc online journals, the journal of technical articles, original, there are onlin...
    vc在线期刊,期刊中的技术文章,有原创,也有网上收集整理的。可以快捷的浏览VC在线的技术文章--第五期(完)-vc online journals, the journal of technical articles, original, there are online collection of. VC can quickly browse the online Technical Articles- V (End)
    2022-09-27 10:00:03下载
    积分:1
  • C++ Primer 3rd Edition 中文版
    C++ Primer 3rd Edition 中文版-C Primer 3rd Edition Chinese version
    2022-02-09 17:14:13下载
    积分:1
  • 696518资源总数
  • 104349会员总数
  • 32今日下载