Graphs Sections NuprlLIB Doc

Def non-trivial-loop(G;i) == j:Vertices(G). j = i & i-G- > *j & j-G- > *i

is mentioned

In prior sections: graph 1 2


Graphs Sections NuprlLIB Doc