搜索结果
找到约 92 项符合
Node 的查询结果
按分类筛选
- 全部分类
- 其他 (9)
- 技术资料 (7)
- 数据结构 (6)
- 单片机编程 (5)
- 单片机开发 (5)
- 技术管理 (4)
- matlab例程 (4)
- 书籍 (4)
- Java编程 (3)
- 源码 (3)
- VIP专区 (3)
- 通信网络 (2)
- 其他嵌入式/单片机内容 (2)
- 电子书籍 (2)
- 其他书籍 (2)
- 操作系统开发 (2)
- Linux/Unix编程 (2)
- 数值算法/人工智能 (2)
- 通讯编程文档 (2)
- 习题答案 (2)
- 嵌入式综合 (1)
- 无线通信 (1)
- 可编程逻辑 (1)
- 源码/资料 (1)
- VHDL/FPGA/Verilog (1)
- 编辑器/阅读器 (1)
- 软件设计/软件工程 (1)
- 文件格式 (1)
- Java书籍 (1)
- 其他行业 (1)
- 网络 (1)
- Ajax (1)
- 汇编语言 (1)
- 编译器/解释器 (1)
- 人工智能/神经网络 (1)
- 系统设计方案 (1)
- JavaScript (1)
- 通讯/手机编程 (1)
- 驱动编程 (1)
- Linux/uClinux/Unix编程 (1)
- 其他 (1)
汇编语言 1、 有n个学生
1、 有n个学生，每个学生有m门成绩，每个学生的m门成绩用一单链表实现，n个学生所对应n个单链表的头指针用一指针数组统一存放。
1) 建立该存贮结构。
2) 查找第i个学生的某门课成绩。
链表中结点结构：
struct node
{char *nam；/*nam为课程名*/
float sco；/*sco为该门课程的成绩*/
struct node *link；/*link为指向 ...
其他 A heap is a binary tree satisfying the following conditions: 􀂄 This tree is completely bal
A heap is a binary tree satisfying the following
conditions:
&#1048708 This tree is completely balanced.
&#1048708 If the height of this binary tree is h, then leaves
can be at level h or level h-1.
&#1048708 All leaves at level h are as far to the left as
possible.
&#1048708 The data associated wit ...
数据结构 伸展树
伸展树，基本数据结构，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.
通讯编程文档 ETSI TS 125 433 V7.9.0(2008-07) Universal Mobile Telecommunications system (UMTS) UTRAN Iub inter
ETSI TS 125 433 V7.9.0(2008-07)
Universal Mobile Telecommunications system (UMTS)
UTRAN Iub interface Node B Application Part (NBAP)
signalling
其他 This is a mutlicore and cluster(of single-core,multi-core systems) matrix inversion code. Which
This is a mutlicore and cluster(of single-core,multi-core systems) matrix inversion code.
Which uses the MPI(Message Passing Interface) for communication across the compute nodes of cluster and using thread-API based OpenMP(Open Multi Processing) between cores of intra-compute or head node.
人工智能/神经网络 Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely ba
Heapsort
1.A heap is a binary tree satisfying the followingconditions:
-This tree is completely balanced.
-If the height of this binary tree is h, then leaves can be at level h or level h-1.
-All leaves at level h are as far to the left as possible.
-The data associated with all descendants of a nod ...
其他书籍 With the Wireless module, OPNET can model both terrestrial and satellite radio systems. In this tut
With the Wireless module, OPNET can model both
terrestrial and satellite radio systems. In this tutorial,
you will use Modeler and Wireless modeling to create a
radio network you will also observe variations in the
quality of received signal that results from radio noise
at the receiving node in a ...
JavaScript Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test c
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The n ...