搜索资源列表
java1(3)
- 这是一个用JAVA编写的从jtree中删除一个节点的代码-This is a preparation with Java from jtree delete a node code
Wireless-Node-1
- her we uploaded code for java scr ipt and it will use for communicating with other system using wireless network
Wireless-Node-2
- her we uploaded code for java scr ipt and it will use for communicating with other system using wireless network
Wireless-Node-3
- her we uploaded code for java scr ipt and it will use for communicating with other system using wireless network
Wireless-Node-4
- her we uploaded code for java scr ipt and it will use for communicating with other system using wireless network
node
- Java Sample for node making
notepad
- java swing的记事本.非常好用的本-java node pad,it can use very easy
Election
- This a zip file is a uncompleted java code simulation for Bully election Algorithm and Ring_based Algorithm It is from my previous job of my friend who is not longer to talk to. The main sketch in which the nodes of algorithm can act. The
nurbs-java
- java写的非均匀B样条插值曲线，从Excel导入原始数据，然后反算控制节点，最后将所有插值点导出到Excel中-java app for non-uniform B-spline interpolation curve, importing raw data from Excel, and then inverse control node, and finally to export to Excel all interpolation points
Java-binary-tree
- 用Java编写的二叉树的数据结构，包括二叉树的每个节点的值，以及各子树的指针。 -Written in Java binary tree data structure, including the value of each node of a binary tree, and each sub-tree pointer.
java
- 用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。-For calculating a node to all other nodes in the shortest path. The main characteristic is the starting point as the center outward layers expand, to extend until the end point.
HostV3
- 实现无线控制,无线路由器的桌面程序,包括节点的状态,信道的多少等等(Wireless control, wireless router desktop program, including the status of the node, the number of channels, and so on)
DeleteTree
- 做项目时需要对tree树进行删除，因为在删除某个节点时，要对这个节点下的所有节点进行删除，所以使用了递归来获取所有需要删除的节点，然后只需对返回的集合进行操作即可，递归方法现已上传(Do the project need to delete the tree tree, because in removing a node, to all nodes on this node are deleted, so use recursion to obtain all need to delete n
Graph with GUI
- 使用户可以添加node，Edges，并且应用一些sorting算法(allows user to add, delete, and move node and edges in graph data structure and play with sorting algorithms)
huffman
- 哈夫曼（Huffman）树又称最优二叉树或最优搜索树，是一种带权路径长度最短的二叉树。在许多应用中，常常赋给树中结点一个有某种意义的实数，称此实数为该结点的权。从树根结点到该结点之间的路径长度与该结点上权的乘积称为结点的带权路径长度(WPL)，树中所有叶子结点的带权路径长度之和称为该树的带权路径长度.(The Huffman (Huffman) tree, also known as the optimal two - fork tree or the optimal search tree,
瀹為獙鍗_rar
- 一个无环无向连通图称为一棵树。树中一个度为一的点称为叶子结点.(An undirected and undirected graph is called a tree. A point in a tree is called a leaf node. I downloaded something first, and I'm sorry to upload it.)
数据结构城市链表
- 1. 城市链表 [问题描述] 将若干城市的信息，存入一个带头结点的单链表。结点中的城市信息包括：城市名，城市的位置坐标。要求能够利用城市名和位置坐标进行有关查找、插入、删除、更新等操作。 [基本要求] （1） 给定一个城市名，返回其位置坐标； （2） 给定一个位置坐标P和一个距离D，返回所有与P的距离小于等于D的城市。(1. City chain list [descr iption of the problem] The information of a number
the-one-1.6.0
- 用于DTN仿真的开发平台，包含多种常见路由算法与节点运动模型。(DTN simulator, include several typical routing schems and node movement model.)
play
- play music document node files good
Desktop
- 提供一款用nodejs做的抓取百度天气api返回json数据的接口服务，内含写有源码的nodejs文本文档，需要搭建node.js或有相应node.js的IDE也可以运行。测试形式如http://39.116.200.155:8000/?city=%E5%8C%97%E4%BA%AC(Provide an interface service that uses nodejs to capture Baidu weather API back to JSON data, including nod