自编的十个Java applet小程序，有绘制笑脸，移动笑脸，闪烁字幕，正旋余玄曲线等，还有一些组合框的控件。...

在WEB页面循环显示一组信息。-in Web pages displayed on a group of information.

大厦游览图,通过命令行来实现 System.out.println("where 显示当前在什么地方") System.out.println("list 列出当前位置的物品") System.out.println("list allspots 列出大厦内所有地点") System.out.println("list spots 列出当前位置附近的地点") System.out.println("list goods 列出当前位置的物品") System.out.println("goto someplace 到另一个地点") System.out.println("look somegoods 查询某个物品是否在当前地点") System.out.println("help 命令行帮助") System.out.println("exit 退出命令行") -Building Tour map, through the command line to achieve System.out.println (

一个遍历文件系统目录结构的程序并能够将其结构用字符打印出来-A traverse file system directory structure of the program and its structure can be printed with characters

一份java上传下载的源码加类的说明 值得学习-From a java source code download class notes plus worth learning

SSD3 Exercise 8的答案 于2009.12.03编写 -the key to Exersice 8

smtpMail.zip

good这是一个非常好的 值得亦看？不是的-good it is a very good worthy do? No

Java编写的一个论坛，请各位多多指教！-Written in a Java forum, I urge the exhibitions!

Eclipse+Struts+MYSQL的留言板,Struts开发入门程序Struts版 这个是一Struts实例,喜欢学习JAVA的朋友可以下载去看看 可以用作Struts入门程序,本人开发的留言簿 功能虽然简单,但是你可以完全的了解Struts这个技术 以后我还会更新这个版本,以后还会结合一些其他技术:ibatis,spring等. 希望喜欢的朋友支持我!-Eclipse+ Struts+ MYSQL message board, Struts to develop Struts version of the entry procedure is a Struts examples, like learning JAVA friends can download to see Struts can be used as entry procedures, I developed the book features, while simple, but you can Struts complete understanding of this technology the future I will update this version, after a number of other technologies will combine: ibatis, spring and so on. I hope to support my favorite friend!

用无向网表示你所在学校的校园景点平面图，图中定点表示主要景点，存放 景点的编号、名称、简介等信息。要求能够回答有关景点介绍、游览路经等问题。 要求：(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.