英语翻译% grBase - find all bases of digraph;% grCoBase - find all contrabases of digraph;% grCoCycleBasis - find all independent cut-sets for a connected graph;% grColEdge - solve the color problem for graph edges;% grColVer - solve the color pr

来源:学生作业帮助网 编辑:作业帮 时间:2024/05/09 00:09:29
英语翻译% grBase - find all bases of digraph;% grCoBase - find all contrabases of digraph;% grCoCycleBasis - find all independent cut-sets for a connected graph;% grColEdge - solve the color problem for graph edges;% grColVer - solve the color pr

英语翻译% grBase - find all bases of digraph;% grCoBase - find all contrabases of digraph;% grCoCycleBasis - find all independent cut-sets for a connected graph;% grColEdge - solve the color problem for graph edges;% grColVer - solve the color pr
英语翻译
% grBase - find all bases of digraph;
% grCoBase - find all contrabases of digraph;
% grCoCycleBasis - find all independent cut-sets for a connected graph;
% grColEdge - solve the color problem for graph edges;
% grColVer - solve the color problem for graph vertexes;
% grComp - find all components of graph;
% grCycleBasis - find all independent cycles for a connected graph;
% grDecOrd - solve the problem about decomposition of the digraph
% to the sections with mutually accessed vertexes
% (strongly connected components);
% grDistances - find the distances between any vertexes of graph;
% grEccentricity - find the (weighted) eccentricity of all vertexes,
% radius,diameter,center vertexes and the periphery vertexes;
% grIsEulerian - find the Eulerian cycle of graph;
% grMaxComSu - solve the maximal complete sugraph problem for the graph;
% grMaxFlows - solve the maximal flow problem for the digraph;
% grMaxMatch - solve the maximal matching problem for the graph;
% grMaxStabSet - solve the maximal stable set problem for the graph;
% grMinAbsEdgeSet - solve the minimal absorbant set problem
% for the graph edges;
% grMinAbsVerSet - solve the minimal absorbant set problem
% for the graph vertexes;
% grMinCutSet - solve the minimal cut-set problem for the digraph;
% grMinEdgeCover - solve the minimal edge cover problem for the graph;
% 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;
% grShortPath - solve the shortest path problem for the digraph;
% grTravSale - solve the nonsymmetrical traveling salesman problem;
% grValidation - auxiliary function (the data validation);
刚下到函数包时挺兴奋的
当看到这么多英文时突然感觉流星出现了,满世界的星星
如果有个函数参数的意义,小弟愿送额外的分数以表感激之情

英语翻译% grBase - find all bases of digraph;% grCoBase - find all contrabases of digraph;% grCoCycleBasis - find all independent cut-sets for a connected graph;% grColEdge - solve the color problem for graph edges;% grColVer - solve the color pr
成grbase -寻找所有基地图; 成grcobase -寻找所有contrabases图; 成grcocyclebasis -寻找所有独立割集为连通; 成grcoledge -解决问题彩色图形边; 成grcolver -解决问题彩色图形顶点; 成grcomp -寻找所有部件图; 成grcyclebasis -寻找所有独立周期为连通; 成grdecord -解决约分解图的成章节相互存取顶点% (收盘 南澳连通成分) ; 成grdistances找到彼此之间的距离任何顶点图; 成greccentricity --找到(加权)偏心各顶点,%半径,直径,中心节点和边缘节点; 成griseulerian --找到欧拉周期图; 成grmaxcomsu -解决最大完全sugraph的问题,因图; 成grmaxflows -解决最大流问题的图; 成grmaxmatch -解决的最大匹配问题,为图; 成grmaxstabset -解决的最大稳定集的问题,因图; 成grminabsedgeset -解决极小吸收集问题成图形边; 成grminabsverset -解决极小吸收集问题成图的顶点; 成grmincutset -解决最小割集的问题,因图; 成grminedgecover -解决最小边复盖问题,为图; 成grminspantree -解决最小生成树问题,为图; 成grminvercover -解决最小顶点复盖问题,为图; 成grpert -解决项目评价研究任务; 成grshortpath -解决最短路径问题,为图; 成grtravsale -解决对称旅行商问题; 成grvalidation辅助功能(数据核实) ;