Qurak
文档
价格
登录
Qurak
文档
函数
EdgeCount
EdgeCount
可用
Returns the number of edges in a graph (optionally matching a pattern)
形式
EdgeCount[g]
EdgeCount[g, patt]
EdgeCount[{v -> w, …}, …]
验证过的示例
g = PetersenGraph[5, 2]; {ConnectedGraphQ[g], EdgeCount[g] ≥ VertexCount[g] - 1} → {True, True}
在 Qurak 上运行
搜索参考
用于
Analyze social networks
- 6 步
主题
Graph Measures
- Basic Measures
Graph Properties And Measurements
- Basic Measures
New In80 Alphabetical Listing
- E
Summary Of New Features In140
- Graphs
Summary Of New Features In140
- Graphs
相关
EdgeList
VertexCount
AdjacencyMatrix
IncidenceMatrix
Graph
EdgeAdd
EdgeDelete
EdgeIndex
EmptyGraphQ
VertexInDegree
AdjacencyList
ConnectedComponents
← EdgeCost
EdgeCoverQ →
全部 6300 个函数
·
从 MCP 客户端使用