Graphs Sections NuprlLIB Doc

Def non-trivial-loop-free(G) == i:Vertices(G). non-trivial-loop(G;i)

is mentioned

In prior sections: graph 1 3


Graphs Sections NuprlLIB Doc