Qurak

CompleteGraphQ

Disponible

Tests whether a graph is complete (every pair adjacent exactly once; a digraph needs both arcs of every pair)

CompleteGraphQ[g]
CompleteGraphQ[g, vlist]

Temas

Relacionadas

Las 6300 funciones · Usar esto desde un cliente MCP