Displaying 4 results from an estimated 4 matches for "howardhinnant".
2018 Mar 30
0
getting all circular arrangements without accounting for order
..., n-3
, v[ -ix[ i, ] ]
)
, ix[ i, 2 ]
)
}
)
cbind( do.call( rbind, x ), n )
}
#######
For more speed, perhaps use Rcpp with [1]?
[1] http://howardhinnant.github.io/combinations.html
On Thu, 29 Mar 2018, Ranjan Maitra wrote:
> Thanks!
>
> Yes, however, this seems a bit wasteful. Just wondering if there are
> other, more efficient options possible.
>
> Best wishes,
> Ranjan
>
>
> On Thu, 29 Mar 2018 22:20:19 -0400 Bori...
2018 Mar 30
3
getting all circular arrangements without accounting for order
Thanks!
Yes, however, this seems a bit wasteful. Just wondering if there are other, more efficient options possible.
Best wishes,
Ranjan
On Thu, 29 Mar 2018 22:20:19 -0400 Boris Steipe <boris.steipe at utoronto.ca> wrote:
> If one is equal to the reverse of another, keep only one of the pair.
>
> B.
>
>
>
> > On Mar 29, 2018, at 9:48 PM, Ranjan Maitra
2018 Mar 30
2
getting all circular arrangements without accounting for order
...i, ] ]
> )
> , ix[ i, 2 ]
> )
> }
> )
> cbind( do.call( rbind, x ), n )
> }
> #######
>
> For more speed, perhaps use Rcpp with [1]?
>
> [1] http://howardhinnant.github.io/combinations.html
>
> On Thu, 29 Mar 2018, Ranjan Maitra wrote:
>
> > Thanks!
> >
> > Yes, however, this seems a bit wasteful. Just wondering if there are
> > other, more efficient options possible.
> >
> > Best wishes,
> > Ranjan
>...
2018 Mar 30
0
getting all circular arrangements without accounting for order
...)
>> , ix[ i, 2 ]
>> )
>> }
>> )
>> cbind( do.call( rbind, x ), n )
>> }
>> #######
>>
>> For more speed, perhaps use Rcpp with [1]?
>>
>> [1] http://howardhinnant.github.io/combinations.html
>>
>> On Thu, 29 Mar 2018, Ranjan Maitra wrote:
>>
>>> Thanks!
>>>
>>> Yes, however, this seems a bit wasteful. Just wondering if there are
>>> other, more efficient options possible.
>>>
>>> Best wi...