该工具箱的部分内容如下:
图论Graph Theory
ancestors -返回DAG A中节点x的祖辈
ancestors - Return the ancestors of nodesx in DAG A
ancestralorder -返回祖辈排序或DAG A(辈分最大的在前)
ancestralorder - Return the ancestral order or theDAG A (oldest first)
descendents -返回DAG A中节点x的子节点
descendents - Return the descendents of nodesx in DAG A
children -返回给定邻接矩阵A的变量x的子代
children - return the children ofvariable x given adjacency matrix A
edges -从邻接矩阵A返回边列表
edges - Return edge list fromadjacency matrix A
elimtri -返回三角图的变量消除序列
elimtri - Return a variableelimination sequence for a triangulated graph
connectedComponents -求邻接矩阵的连通分量
connectedComponents - Find the connected components of anadjacency matrix
istree -检查图形是否单连接
istree - Check if graph issingly-connected
neigh -用邻接矩阵G求出图中顶点v的邻域
neigh - Find the neighbours ofvertex v on a graph with adjacency matrix G
noselfpath -返回不包括自转换的路径
noselfpath - return a path excluding selftransitions
parents -返回给定邻接矩阵A的变量x的父变量
parents - return the parents ofvariable x given adjacency matrix A
spantree -从边缘列表中查找生成树
spantree - Find a spanning tree from anedge list
triangulate - 三角邻接矩阵A
triangulate - Triangulate adjacency matrix A
…
完整源码下载地址:
http://page2.dfpan.com/fs/el8c9j62220132b9166/
更多精彩文章请关注微信号: