Graph algorithms form a very important part of computer science and have a lineage that goes back at least to Euler and the famous Seven Bridges of konigsberg problem.
计算机科学中的一个非常重要的组成部分就是图论算法，它们都可以追溯到欧拉和著名的哥尼斯堡七桥问题。
In this paper, a new data structure of graph, double list, is presented. It is more flexible than other data structures of graph and shows better time and space complexity in graph algorithms.
本文提出了图的一种双链式存储结构，比以往的图的链式存储结构有更好的灵活性，并在图的各种算法的实现上显示了较好的时空复杂性，具有其它存储结构所不具备的各种优点。
And the algorithms are just as important - from binary search to different sorts to graph traversals, a rockstar engineer must know and internalize the basics.
算法也同样重要，从二分查找到各种排序，到图形遍历，一位明星工程师必须知道并内在消化这些基础东西。
Some of the search algorithms in the blessed Boost Graph Library use this technique.
BoostGraph库中的某些搜索算法使用了这项技术。
Additionally common graph based algorithms like path-searches are easy to implement by traversing through the graph.
另外，基于如路径-查询(Path - Search)算法的普通图，也易于通过遍历图来实现。
To make things simple, the package org.eclipse.draw2d.internal.graph has many implementations of GraphVisitor that already have specific algorithms to visit a graph.
为了简便起见，包org . eclipse . draw2d . internal .graph中有许多GraphVisitor实现，这些GraphVisitor有一些用来访问图形的特定算法。
This paper introduces principles and algorithms of the pre-and postprocessing graphical system GRAPH-W for structural analysis in engineering CAD.
本文介绍工程CAD中结构分析前后处理绘图系统GRAPH - W的原理和算法。
The characters of the new method are: the structures of the different graph drawing algorithms are the same, the difference exists only in the objective functions which reflect aesthetic criteria.
新方法的特点是：不同的画图算法的框架都一样，所不同的只是反映无向图画图问题的美观标准的目标函数。
Based on traditional directed graph partitioning algorithms, this paper presents a multi-objective directed graph partitioning algorithm that can control the tradeoffs among above four objectives.
本文在传统有向图剖分算法的基础上，提出了一个权衡这四个目标的有向图多目标剖分区域分解算法。
By the graph representation, we discuss the girth and diameter of a bipartite graph, and their roles in improving the efficiency of decoding algorithms and the performance of the code.
根据低密度码的图结构表示，研究双向图的周长、直径，及其对提高译码算法效率和码的性能所起的作用。
This paper discusses algorithms of the shortest path in a weighted graph as well as the shortest path transformations resulted from it, and gives a simple program solving problem of MATLAB.
讨论了一个带权图的最短路径的算法及其若干个变形问题的算法，并在MATLAB软件环境下对最短路径问题给出了一个简捷易懂的程序。
Two algorithms, graph cut and random walk based on graph theory, were applied to motion segmentation.
将两种基于图论的算法图切割与随机游走应用于运动对象的分割。
This paper use weighted directed graph to describe user visit and conversation records, and use clustering algorithms to realize the page clustering by the weighted directed graph mode established.
利用有向带权图表示用户的访问会话记录，对建立的有向带权图模型运用聚类算法实现页面聚类。
This paper proposes two algorithms based on priority analysis and graph traversal respectively to automatically choose the section cut of key features such as holes and slots.
根据零件的孔、槽等剖切特征，提出基于优先度和基于图遍历的两种自动搜索关键特征产生剖切线的算法，并分别结合实例进行了比较。
A localization and object tracking approach based on statistical operators and graph searching algorithms is presented for a team of robots localized with heterogeneous sensors.
以统计的操作员和曲线图搜索运算法则为基础的一个局限和物体追踪方式为与异种的感应器一起本土化的一队机械手被呈现。
Three algorithms for function constraint based parametric graph design are presented, and some results in practice are offered.
在实践的基础上总结提出了基于功能约束的参数化图形设计的三种算法，并给出了部分实践的结果。
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
也许同样重要的是基本的算法，如二进制搜索，图形搜索算法，排序算法，并基于树的极小搜索。
As for the ramp engineering, the author put forward the difference incremental algorithms for the planar graph gradients.
针对斜坡道工程，提出平面图形梯度差值生长构建算法；
Applying the classical graph drawing algorithms to node localization in wireless sensor networks is a novel idea.
将经典的画图算法应用到无线传感器网络节点定位问题是一个全新的思路。
Experiments show that the new optimized partition algorithm can improve the parallel simulation performance compared with the ones partitioned by traditional graph partition algorithms.
实验表明，该优化划分方法相对于传统的图划分算法能够有效地提高模拟性能。
It proves a schema theorem for genetic algorithms in which representation schema is based on graph grammar. The effect of crossover and mutation on schemata is described.
证明了一个基于图文法表示机制的遗传算法模式定理，描述了交叉和突变对模式作用的效果。
Then the algorithms of graph coloring are studied and compared;
然后对图论着色中的几种算法进行了详细研究并比较总结；
The paper put forward a new improved least mean square algorithms which is on the basis of the fundamental of convergence step and the graph connection between error and step.
本文根据现有的步长调整原则，利用误差和步长关系曲线特点，提出了新的变步长最小均方算法。
Crab Graphs, Algorithms, Graph Theory, How is this network flow?
蟹图形、算法、图论这网络流是怎么做的？
The traversing algorithm for the simple graph has been researched for many years and lots of mature algorithms are developed.
简单图遍历算法已经非常成熟，但是还没有完善的冗余拓扑图遍历算法。
An uncorrelated kernel extension of graph embedding which provides a unified method for computing all kinds of uncorrelated kernel dimensionality reduction algorithms is proposed.
提出统计不相关的核化图嵌入算法，为求解各种统计不相关的核化降维算法提供了一种统一方法。
An uncorrelated kernel extension of graph embedding which provides a unified method for computing all kinds of uncorrelated kernel dimensionality reduction algorithms is proposed.
提出统计不相关的核化图嵌入算法，为求解各种统计不相关的核化降维算法提供了一种统一方法。
应用推荐