搜索资源列表
Graph_Theory_Reinhard_Diestel
- 图论,研究拓扑学,工程设计等的国外经典教程,英文原版,非常清晰,非扫描图片-Graph theory, topology studies, engineering design tutorials foreign classics, English original, very clear, non-scan images
1
- 给定一个有向图,实现图的深度优先, 广度优先遍历算法,拓扑有序序列,并输出相关结果。 功能要求:输入图的基本信息,并建立图存储结构(有相应提示),输出遍历序列,然后进行拓扑排序,并测试该图是否为有向无环图,并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the
1-s2.0-S1389128609002217-main
- A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks We consider the channel assignment problem in a multi-radio wireless mesh network that involves assigning channels to radio interfaces for achieving e