登录
首页 » Java » first-person-shooter

first-person-shooter

于 2012-06-17 发布 文件大小:2892KB
0 162
下载积分: 1 下载次数: 7

代码说明:

  基于DirectX的第一人称射击游戏制作,纯手工打造的小游戏(Produced based on DirectX, first person shooter)

文件列表:

胡时阳的论文.doc,3494400,2012-06-17

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

发表评论


0 个回复

  • JDK-6
    java jdk6的中文文档 介绍了JavaTM Platform Standard Edition 6 API 规范 (java jdk6 Chinese document on JavaTM Platform Standard Edition 6 API Specification)
    2012-04-26 14:36:25下载
    积分:1
  • Distributed_Videostreaming
    这是一个peer to peer的视频流系统. 该系统采用RTP协议,因此与某些采用http/ftp协议进行传输的系统不同,本系统在视频流下载的过程中就可以同时观看。(This is a peer-to-peer Video System. The system uses RTP, Thus, some use http/ftp protocol transmission system, The video streaming system in the process of downloading it can watch.)
    2007-05-25 15:23:27下载
    积分:1
  • LocalVariableExtractor
    Code to figure out which local variables are active at which points in a method.
    2013-11-04 09:33:44下载
    积分:1
  • ViewpagerDemo.tar
    这个例子主要针对初学者,对viewpager的扩展用法,一目了然。(This example is mainly for beginners, the expansion of the use of viewpager, at a glance.)
    2016-02-04 11:16:50下载
    积分:1
  • spring-security
    spring security 自定义配置 docker 使用文档(Spring security custom configuration docker usage documentation)
    2020-06-17 19:40:01下载
    积分:1
  • jsf_example
    一个jsf企业级程序示例实现一些基本功能()
    2008-07-17 12:52:15下载
    积分:1
  • liredemo
    说明:  基于lunce,liredemo 演示文档(Demo document based on lunce and liredemo)
    2020-06-24 18:40:02下载
    积分:1
  • GN
    说明:  GN算法是一种经典的web社区发现算法,java语言。可用实例验证(the GN algorithm is a kind of classic web community discovery algorithm )
    2014-04-25 20:33:11下载
    积分:1
  • AbstractMessageLite
    A partial implementation of the MessageLite interface which implements as many methods of that interface as possible in terms of other methods for Andriod.
    2013-10-06 00:26:08下载
    积分:1
  • 50402417
    和树类似,图的遍历是图的一种主要操作,可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量,但对于带权图(网),其最小生成树或最短路径都取决于弧或边上的权值,则需要有特定的算法求解。(and similar trees, graph traversal map is a major operation, Discrimination can traverse map between any two vertices existence trails Discriminant to whether the map graph may seek non- graph the various connectivity components, but with the right plan (net), the minimum spanning tree or shortest path depends on the edge of the arc or the right values, the need for a specific algorithm.)
    2007-01-08 22:32:38下载
    积分:1
  • 696518资源总数
  • 104658会员总数
  • 44今日下载