Returns True if
Ghas no edges.
A NetworkX graph.
Ghas no edges, and False otherwise.
An empty graph can have nodes but not edges. The empty graph with zero nodes is known as the null graph. This is an \(O(n)\) operation where n is the number of nodes in the graph.