Tersedia
Tests whether a graph is complete (every pair adjacent exactly once; a digraph needs both arcs of every pair)
Semua 6300 fungsi · Gunakan ini daripada klien MCP