zoukankan      html  css  js  c++  java
  • Operators 操作

    该模块完成一些有关图取交集取并集等操作的功能
     
    Unary operations on graphs 一元操作
    complement(G[, name]) Return the graph complement of G. 返回图G的补集
    reverse(G[, copy]) Return the reverse directed graph of G. 反转有向图G
     
    Operations on graphs including union, intersection, difference. 并集、交集、差集
    compose(G, H[, name]) Return a new graph of G composed with H. 返回由H组成的图G
    union(G, H[, rename, name]) Return the union of graphs G and H. 返回图G和H的并集
    disjoint_union(G, H) Return the disjoint union of graphs G and H. 返回图G和H不相交的并集
    intersection(G, H) Return a new graph that contains only the edges that exist in both G and H. 返回图G和H的交集
    difference(G, H) Return a new graph that contains the edges that exist in G but not in H. 返回在G不在H中的边
    symmetric_difference(G, H) Return new graph with edges that exist in either G or H but not both. 返回不同时在G、H中边构成的网络
     
    Operations on many graphs. 多图操作
    compose_all(graphs[, name]) Return the composition of all graphs. 返回所有图的合成
    union_all(graphs[, rename, name]) Return the union of all graphs. 返回所有图的并集
    disjoint_union_all(graphs) Return the disjoint union of all graphs. 返回所有图不相交的并集
    intersection_all(graphs) Return a new graph that contains only the edges that exist in all graphs. 返回所有图的交集
     
    Graph products. 图生成
    cartesian_product(G, H) Return the Cartesian product of G and H. 返回图G和H的笛卡尔集 
    lexicographic_product(G, H) Return the lexicographic product of G and H. 返回图G和H的字典集
    strong_product(G, H) Return the strong product of G and H.
    tensor_product(G, H) Return the tensor product of G and H. 返回图G和H的张量集
    power(G, k) Returns the specified power of a graph. 返回图G的k次幂 
  • 相关阅读:
    重新看待Jar包冲突问题及解决方案
    一步步完成Maven+SpringMVC+SpringFox+Swagger整合示例
    [ACM] POJ 1611 The Suspects (并查集,输出第i个人所在集合的总人数)
    James Whittaker的软件測试戒律(二)
    <html>
    andorid ndk 各种坑啊 记录下
    Android的ProgressBar进度条-android学习之旅(三十一)
    Android Jsoup 爬取网页数据
    iOS笔记UI--使用storyboard加入约束
    使用appledoc 生成技术API文档具体解释
  • 原文地址:https://www.cnblogs.com/sxbjdl/p/5328075.html
Copyright © 2011-2022 走看看