SimpleGraphQ

Beschikbaar

Tests whether a graph has no self-loops or multi-edges (a directed edge and its reverse are different edges)

Vormen

SimpleGraphQ[g]

Doorzoek de referentie

Onderwerpen

Graph Predicates - Local Structural Properties
Graph Properties And Measurements - Structural Properties
New In80 Alphabetical Listing - S

Gerelateerd

Graph DirectedEdges LoopFreeGraphQ AdjacencyMatrix AcyclicGraphQ BipartiteGraphQ ConnectedGraphQ DirectedGraphQ EmptyGraphQ EulerianGraphQ HamiltonianGraphQ PathGraphQ

Alle 6300 functies · Gebruik dit vanuit een MCP-client