avl tree and bplus tree

风暴设计『留言簿v1.0』jsp版安装过程 1.服务器装有jdk和resin服务器等 2.安装完JSDK后，配置下面的内容： 在系统变量中找到ClassPath并加入下面内容(如果你找不到ClassPath，则新建它)： c:jsdkLIBdt.JAR c:jsdkLIBTOOLS.JAR c:jsdkBIN . 再在系统变量中找到Path并加入下面内容： c:jsdk c:jsdkin 3.直接解压resin就可以运行把程序放在doc目录下面把classes目录的文件放在 WEB-INF目录下 4.在odbc放里加入数据库路径为guestbook也可改为别的要修改classesmyjspdbconn.java文件 5.上面成功后就可以http://localhost:8080/目录名/可以访问了。。 Any Problem Please Contact to kuflash@hotmail.com http://xxgc.zjbti.net.cn/kuflash 亿龙电脑网 -turmoil design book v1.0] jsp a version of the installation process. Jdk installed servers and servers resin 2. JSDK after installing, configuring the following : the system variables and find ClassPath add the following (if you can not find ClassPath, it is new) : c : jsdkLIBdt.JAR c : jsdkLIBTOOLS.JAR c : jsdkBIN. another variable in the system and find the Path add the following : c : jsdk c : jsdk in three. direct extracting resin can run the procedure on the doc directory classes put on the list of documents WEB-INF directory 4. li Fang in od

此项目主要实现：获取复选框中被选中的值 并显示所选数据-Good

一个模仿windows下扫雷游戏的在unix下用java实现的扫雷-A mine under windows to imitate the game in unix using java realize the de-mining

这是我最新做的一个网络联系的-This is the latest I do a network linked to the

一个聊天室程序．希望大家喜欢-a chat room procedures. Hope you like

用JXTA实现的P2P应用程序，该应用程序主要是以异步方式完成对HungryPeer的功能-using JXTA P2P applications, The application is based on asynchronous manner to the function HungryPeer

jsp视频教程第二课-jsp second video tutorial classes

a Pong applet by zimardi

用无向网表示你所在学校的校园景点平面图，图中定点表示主要景点，存放 景点的编号、名称、简介等信息。要求能够回答有关景点介绍、游览路经等问题。 要求：(1)查询各景点相关信息； (2)查询图中任意两个景点的最短路径。 (3)查询图中任意两个景点的所有路径。 --Free to the net means that the school campus attractions in your plans, the figure fixed-point of their main attractions, storage spots number, name, profile and other information. Requires the ability to answer questions about attractions introduction, tour passing by and so on. Requirements: (1) check the relevant information sites (2) query graph the shortest path between any two spots. (3) The query graph for all paths of any two spots.

java做的一个学生成绩系统，很粗糙而且功能有限，是老师要求做的作业，呵呵！刚刚开始学习JAVA-java to do a student achievement system, it is rough and limited functions, is the teacher asked to do the operation, huh, huh! Just started to learn JAVA