anchor.diff:              case is_atom(Node) of
                   true -> io:format("graph_as_query: unknown atom: ~p~n", [Node]),
                           Out = [];
  -                _ -> Out = Out0
  +                _ -> 
  +                    Out = Out0
               end
       end,
       case length(Out) of
  
positive.code:                         C+1;
                      {node, {lor, N}, _Node} ->
                          %%io:format("[~p] lor: ~p~n", [Node, N]),
                          V = {lor, C},
                          digraph:add_vertex(G, V, "or"),
                          digraph:add_edge(G, Parent, V, "has-or"),
                          digraph:add_edge(G, or_ops, V, "has-member"),
                          query_as_graph(N, V, C+1, G)+1;
                      {node, {land, N}, _Node} ->
                          %%io:format("[~p] land: ~p~n", [Node, N]),
                          V = {land, C},
                          digraph:add_vertex(G, V, "and"),
                          digraph:add_edge(G, Parent, V, "has-and"),
                          digraph:add_edge(G, and_ops, V, "has-member"),
                          query_as_graph(N, V, C+1, G)+1;
                      {lnot, N} ->
                          %%io:format("lnot: ~p~n", [N]),
                          V = {lnot, C},
                          digraph:add_vertex(G, V, "not"),
                          digraph:add_edge(G, Parent, V, "has-not"),
                          digraph:add_edge(G, not_ops, V, "has-member"),
                          query_as_graph(N, V, C+1, G)+1;
                      {term, IFT, Props} ->
                          %%io:format("term, IFT = ~p, Props = ~p~n",
                          %%    [IFT, Props]),
  
negative.code:                         end
                      end, [], Out);
                  _ ->
                      io:format("graph_as_query: unknown_node_type: ~p: ~p~n", [Node, Out]),
                      {unknown_node_type, Node}
              end
      end.
  