Duncan Murdoch wrote:
Maximilian Kofler wrote:
Duncan Murdoch gmail.com> writes:
I doubt if that was the error message. More likely you saw
Error: evaluation nested too deeply: infinite recursion /
options(expressions=)?
Exactly this was the error message I recieve
Maximilian Kofler wrote:
Duncan Murdoch gmail.com> writes:
I doubt if that was the error message. More likely you saw
Error: evaluation nested too deeply: infinite recursion /
options(expressions=)?
Exactly this was the error message I recieved
This isn't a case of the sourc
Duncan Murdoch gmail.com> writes:
> I doubt if that was the error message. More likely you saw
>
> Error: evaluation nested too deeply: infinite recursion /
> options(expressions=)?
Exactly this was the error message I recieved
>This isn't a case of the source being nested to deeply, but r
Maximilian Kofler wrote:
Hi all!
I¹m just implementing the Ullmann¹s algorithm for searching subgraph
isomorphisms in graphNEL objects. The algorithm is running with smaller
graphs, but when I¹m calling it i get an R error message saying that
functions are nested too deeply in source code.
I
Forgot to add that function collation "and"'s two binary vectors.
For example 1 0 0 and 1 0 1 in collation returns 1 0 0. But how already
said, the algorithm itself should work fine because with small graphs I
don't have problems
__
R-help@r-project.org
Hi all!
I¹m just implementing the Ullmann¹s algorithm for searching subgraph
isomorphisms in graphNEL objects. The algorithm is running with smaller
graphs, but when I¹m calling it i get an R error message saying that
functions are nested too deeply in source code. I found out that the problem
is
6 matches
Mail list logo