Qurak

IncidenceGraph

可用

Builds the graph with a given vertex-by-edge incidence matrix (optionally with named vertices)

IncidenceGraph[m]
IncidenceGraph[{v1, v2, …}, m]
IncidenceGraph[{{0, 1, 1}, {1, 0, 1}, {1, 1, 0}}] → Graph[<3>, <3>]IncidenceGraph[{{0, -1, 1}, {1, 0, -1}, {-1, 1, 0}}] → Graph[<3>, <3>]IncidenceGraph[{{2, 0, 1, 1}, {0, 1, 0, 1}, {0, 1, 1, 0}}] → Graph[<3>, <4>]

主題

相關

全部 6300 個函式 · 從 MCP 用戶端使用這個