求翻译一下图论工具箱的说明

死活不出牌

我是新手 刚接触图论 对工具箱不太会使用 英语看的不太懂
, h- @; a- J5 P; s% }grBase - find all bases of digraph;所有有向图的基是什么？？
7 l) F8 w) k. L- R % grCoBase - find all contrabases of digraph;contrabase是什么意思
% grCoCycleBasis - find all independent cut-sets for a connected graph;求割集 这个可以理解
% grColEdge - solve the color problem for graph edges;这是没学过 希望有人可以解释一下
7 o8 L7 s3 r) C- M % grColVer - solve the color problem for graph vertexes;这是没学过 希望有人可以解释一下
9 Z5 c" |4 P9 M, C % grComp - find all components of graph;找到图的成分？？不理解
# U& \& }% A; G) ?8 u) U5 X % grCycleBasis - find all independent cycles for a connected graph;这个懂了，求图的所有圈
% grDecOrd - solve the problem about decomposition of the digraph 分解图？？求详细解释
4 Y. v# r& d% d5 t4 y %   to the sections with mutually accessed vertexes
* |- Z# m+ d8 W  g; p& `5 e%   (strongly connected components);
% grDistances - find the distances between any vertexes of graph;这个知道 求最短路
% grEccentricity - find the (weighted) eccentricity of all vertexes,
3 ]0 D+ {  }! {( g  ] %   radius, diameter, center vertexes and the periphery vertexes;
% grIsEulerian - find the Eulerian cycle of graph;判断是否为欧拉图
0 B2 x4 j" z8 v % grMaxComSu - solve the maximal complete sugraph problem for the graph;
% grMaxFlows - solve the maximal flow problem for the digraph;
* h  l& Y% G+ O" P( e7 a % grMaxMatch - solve the maximal matching problem for the graph;
/ M# `8 M" \/ t  j: f6 a % grMaxStabSet - solve the maximal stable set problem for the graph;
% grMinAbsEdgeSet - solve the minimal absorbant set problem
%   for the graph edges;
+ a+ U& W4 v  m5 q7 J % grMinAbsVerSet - solve the minimal absorbant set problem
$ V1 B9 @3 e& t3 w& ]; S5 K* A%   for the graph vertexes;
% grMinCutSet - solve the minimal cut-set problem for the digraph;不会
% grMinEdgeCover - solve the minimal edge cover problem for the graph;这和最小生成树有什么区别
" ~5 |% h- `. Z, v' l % grMinSpanTree - solve the minimal spanning tree problem for the graph;最小生成树
% grMinVerCover - solve the minimal vertex cover problem for the graph;
% grPERT - solve the project evaluation research task;不知道是什么意思
% grPlot - draw the plot of the graph (digraph);不懂
% grShortPath - solve the shortest path problem for the digraph;这个求最短路
% grTravSale - solve the nonsymmetrical traveling salesman problem;旅行商问题 不过希望能说详细点 怎么实现的
- P' _- _' U. C. F; q* g; H1 C % grValidation - auxiliary function (the data validation);这个是判断输入邻接矩阵是否合法
%
6 I2 m" a6 {: N1 q$ n0 B % grTheoryTest - test program for all functions.
2 |1 n; U: o( F4 U9 l  d' P+ b( x

byrontc

grbase -寻找所有基地图;
grcobase -寻找所有contrabases图;
( M1 u3 W+ I( h" L( K5 m+ Dgrcocyclebasis -寻找所有独立割集为连通;
6 W; ?  l1 G( b' |% N% m" ^, [4 Qgrcoledge -解决问题彩色图形边;
# U4 @1 W) v+ ~  Wgrcolver -解决问题彩色图形顶点;
grcomp -寻找所有部件图;
grcyclebasis -寻找所有独立周期为连通;
grdecord -解决约分解图的成章节相互存取顶点% (收盘 南澳连通成分) ;
% s" _2 {0 h" `# @grdistances找到彼此之间的距离任何顶点图;
! O- v+ Z0 @+ ~3 lgreccentricity --找到(加权)偏心各顶点, %半径,直径,中心节点和边缘节点;
griseulerian --找到欧拉周期图;
0 l: I1 a& z9 a* L" P" Fgrmaxcomsu -解决最大完全sugraph的问题,因图;
grmaxflows -解决最大流问题的图;
# H% z0 ?* x" G5 fgrmaxmatch -解决的最大匹配问题,为图;
grmaxstabset -解决的最大稳定集的问题,因图;
grminabsedgeset -解决极小吸收集问题成图形边;
grminabsverset -解决极小吸收集问题成图的顶点;
grmincutset -解决最小割集的问题,因图;
grminedgecover -解决最小边复盖问题,为图;
$ z, @3 D6 f! ~2 ~# t) zgrminspantree -解决最小生成树问题,为图;
8 E* Z! w9 P; z, F+ [* n. `grminvercover -解决最小顶点复盖问题,为图;
grpert -解决项目评价研究任务;
grshortpath -解决最短路径问题,为图;
grtravsale -解决对称旅行商问题;
grvalidation辅助功能(数据核实) ;

咖啡小馆的狼

byrontc 发表于 2012-5-30 19:44
4 [8 z$ i/ x) M3 c5 t- [grbase -寻找所有基地图;
grcobase -寻找所有contrabases图;
) k/ ^2 X: t* tgrcocyclebasis -寻找所有独立割集为连通;  ...

! d" w! o' \. N8 d  ?# |: c谢谢！有幸看到了。能不能举个例子啊。

考试必过2014

谢谢！有幸看到了。能不能举个例子啊。

深藏在云端

额…………………………………………………………
; T& P- N% s8 f