Hi,
Adam, thank you :)
Aldrin:
First, I tried to implement the basic data structures needed for graph
algorithms, namely a queue and a heapq (for breadth first search
and dijkstra (weighted shortest path)). That's when I had some problems
since Apache Arrow objects are immutable.
This is how I
Hi,
@Adam, thank you :)
@Aldrin:
First, I tried to implement the basic data structures needed for graph
algorithms, namely a queue and a heapq (for breadth first search
and dijkstra (weighted shortest path)). That's when I had some problems
since Apache Arrow objects are immutable.
This is how
recent tensor type addition, or simply creating zero
> copy or memcopy based efficient converters would be something worth
> exploring.
>
> Best regards,
> Adam alippai
>
> On Fri, Jun 30, 2023 at 06:57 Bechir Ben Daadouch
> wrote:
>
> > Thank you for taking the ti
ache Arrow without resorting to other
libraries.
On Fri, Jun 30, 2023, 07:36 Benson Muite wrote:
> On 6/30/23 04:21, Bechir Ben Daadouch wrote:
> > Dear Apache Arrow Dev Community,
> >
> > My name is Bechir, I am currently working on a project that involves
> > implemen
Dear Apache Arrow Dev Community,
My name is Bechir, I am currently working on a project that involves
implementing graph algorithms in Apache Arrow.
The initial plan was to construct a node structure and a subsequent graph
that would encompass all the nodes. However, I quickly realized that due t
