Qurak

EdgeTaggedGraph

可用

Graph whose edges all carry a tag; an untagged edge is tagged by how many copies of it came before

EdgeTaggedGraph[{e1, e2, …}]
EdgeTaggedGraph[{e1, e2, …} -> {t1, t2, …}]
EdgeTaggedGraph[{v1, v2, …}, {e1, e2, …} -> {t1, t2, …}]
EdgeTaggedGraph[{…, wi[vi], …}, {…, wj[ej], …} -> {t1, t2, …}]
EdgeTaggedGraph[{1 -> 2, 2 -> 3, 3 -> 1}] → Graph[<3>, <3>]EdgeTaggedGraph[{1 -> 2, 2 -> 3, 3 -> 1}, DirectedEdges -> False] → Graph[<3>, <3>]

主題

相關

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