释义 |
complete graph
complete graph[kəm¦plēt ′graf] (mathematics) A graph with exactly one edge connecting each pair of distinct vertices and no loops. complete graphA graph which has a link between every pair of nodes. Acomplete bipartite graph can be partitioned into two subsetsof nodes such that each node is joined to every node in theother subset. |