Hi,

Guest

BA

Buenos Aires Smalltalk

Wed, Mar 31, 2021 8:01 PM

Mole, a model for graphs, both directed and undirected. reached it's v3.2.0 version.

- Updated dependencies
- Add Pharo 9 as a supported platform
- Use GitHub actions for the build

Regards,

The Buenos Aires Smalltalk team

AB

Alexandre Bergel

Thu, Apr 1, 2021 10:08 AM

Hello,

That is awesome!

I looked at the documentation, but I am left with one question:

- is there a way to run a graph traversal algorithm on any arbitrary object? (e.g., Color red)

Cheers,

Alexandre

On 31 Mar 2021, at 22:01, Buenos Aires Smalltalk github@fast.org.ar wrote:

Mole, a model for graphs, both directed and undirected. reached it's v3.2.0 version.

Changelog

```
• Updated dependencies
• Add Pharo 9 as a supported platform
• Use GitHub actions for the build
```

Regards,

The Buenos Aires Smalltalk team

Hello,
That is awesome!
I looked at the documentation, but I am left with one question:
- is there a way to run a graph traversal algorithm on any arbitrary object? (e.g., Color red)
Cheers,
Alexandre
> On 31 Mar 2021, at 22:01, Buenos Aires Smalltalk <github@fast.org.ar> wrote:
>
> Mole, a model for graphs, both directed and undirected. reached it's v3.2.0 version.
>
> Changelog
>
> • Updated dependencies
> • Add Pharo 9 as a supported platform
> • Use GitHub actions for the build
> Regards,
>
> The Buenos Aires Smalltalk team
>

GC

Gabriel Cotelli

Thu, Apr 1, 2021 8:26 PM

If I understand your question properly, without creating the graph that

model the relationship between the objects involved the answer is no. I

have to review the traversal algorithms to see if it is feasible to avoid

creating the graph.

On Thu, Apr 1, 2021, 07:08 Alexandre Bergel via Pharo-users <

pharo-users@lists.pharo.org> wrote:

Hello,

That is awesome!

I looked at the documentation, but I am left with one question:

- is there a way to run a graph traversal algorithm on any

arbitrary object? (e.g., Color red)

Cheers,

Alexandre

On 31 Mar 2021, at 22:01, Buenos Aires Smalltalk github@fast.org.ar

wrote:

Mole, a model for graphs, both directed and undirected. reached it's

v3.2.0 version.

Changelog

```
• Updated dependencies
• Add Pharo 9 as a supported platform
• Use GitHub actions for the build
```

Regards,

The Buenos Aires Smalltalk team

If I understand your question properly, without creating the graph that
model the relationship between the objects involved the answer is no. I
have to review the traversal algorithms to see if it is feasible to avoid
creating the graph.
On Thu, Apr 1, 2021, 07:08 Alexandre Bergel via Pharo-users <
pharo-users@lists.pharo.org> wrote:
> Hello,
>
> That is awesome!
> I looked at the documentation, but I am left with one question:
> - is there a way to run a graph traversal algorithm on any
> arbitrary object? (e.g., Color red)
>
> Cheers,
> Alexandre
>
> > On 31 Mar 2021, at 22:01, Buenos Aires Smalltalk <github@fast.org.ar>
> wrote:
> >
> > Mole, a model for graphs, both directed and undirected. reached it's
> v3.2.0 version.
> >
> > Changelog
> >
> > • Updated dependencies
> > • Add Pharo 9 as a supported platform
> > • Use GitHub actions for the build
> > Regards,
> >
> > The Buenos Aires Smalltalk team
> >
>

AB

Alexandre Bergel

Fri, Apr 2, 2021 5:03 AM

If I understand your question properly, without creating the graph that model the relationship between the objects involved the answer is no. I have to review the traversal algorithms to see if it is feasible to avoid creating the graph.

Being able to consider any Pharo objects as the root of a graph and running some traversal algorithm would be fantastic. Cycles should be supported as well :-D

Cheers,

Alexandre

On Thu, Apr 1, 2021, 07:08 Alexandre Bergel via Pharo-users pharo-users@lists.pharo.org wrote:

Hello,

That is awesome!

I looked at the documentation, but I am left with one question:

- is there a way to run a graph traversal algorithm on any arbitrary object? (e.g., Color red)

Cheers,

Alexandre

On 31 Mar 2021, at 22:01, Buenos Aires Smalltalk github@fast.org.ar wrote:

Mole, a model for graphs, both directed and undirected. reached it's v3.2.0 version.

Changelog

```
• Updated dependencies
• Add Pharo 9 as a supported platform
• Use GitHub actions for the build
```

Regards,

The Buenos Aires Smalltalk team

> If I understand your question properly, without creating the graph that model the relationship between the objects involved the answer is no. I have to review the traversal algorithms to see if it is feasible to avoid creating the graph.
Being able to consider any Pharo objects as the root of a graph and running some traversal algorithm would be fantastic. Cycles should be supported as well :-D
Cheers,
Alexandre
>
> On Thu, Apr 1, 2021, 07:08 Alexandre Bergel via Pharo-users <pharo-users@lists.pharo.org> wrote:
> Hello,
>
> That is awesome!
> I looked at the documentation, but I am left with one question:
> - is there a way to run a graph traversal algorithm on any arbitrary object? (e.g., Color red)
>
> Cheers,
> Alexandre
>
> > On 31 Mar 2021, at 22:01, Buenos Aires Smalltalk <github@fast.org.ar> wrote:
> >
> > Mole, a model for graphs, both directed and undirected. reached it's v3.2.0 version.
> >
> > Changelog
> >
> > • Updated dependencies
> > • Add Pharo 9 as a supported platform
> > • Use GitHub actions for the build
> > Regards,
> >
> > The Buenos Aires Smalltalk team
> >

D

ducasse

Fri, Apr 2, 2021 7:24 AM

Yes I would like to see if we can migrate some moose algo to Mole.

S

On 2 Apr 2021, at 07:03, Alexandre Bergel via Pharo-users pharo-users@lists.pharo.org wrote:

If I understand your question properly, without creating the graph that model the relationship between the objects involved the answer is no. I have to review the traversal algorithms to see if it is feasible to avoid creating the graph.

Being able to consider any Pharo objects as the root of a graph and running some traversal algorithm would be fantastic. Cycles should be supported as well :-D

Cheers,

Alexandre

On Thu, Apr 1, 2021, 07:08 Alexandre Bergel via Pharo-users pharo-users@lists.pharo.org wrote:

Hello,

I looked at the documentation, but I am left with one question:

- is there a way to run a graph traversal algorithm on any arbitrary object? (e.g., Color red)

Cheers,

Alexandre

On 31 Mar 2021, at 22:01, Buenos Aires Smalltalk github@fast.org.ar wrote:

Mole, a model for graphs, both directed and undirected. reached it's v3.2.0 version.

Changelog

```
• Updated dependencies
• Add Pharo 9 as a supported platform
• Use GitHub actions for the build
```

Regards,

The Buenos Aires Smalltalk team

Yes I would like to see if we can migrate some moose algo to Mole.
S
> On 2 Apr 2021, at 07:03, Alexandre Bergel via Pharo-users <pharo-users@lists.pharo.org> wrote:
>
>> If I understand your question properly, without creating the graph that model the relationship between the objects involved the answer is no. I have to review the traversal algorithms to see if it is feasible to avoid creating the graph.
>
> Being able to consider any Pharo objects as the root of a graph and running some traversal algorithm would be fantastic. Cycles should be supported as well :-D
>
> Cheers,
> Alexandre
>
>>
>> On Thu, Apr 1, 2021, 07:08 Alexandre Bergel via Pharo-users <pharo-users@lists.pharo.org> wrote:
>> Hello,
>>
>> That is awesome!
>> I looked at the documentation, but I am left with one question:
>> - is there a way to run a graph traversal algorithm on any arbitrary object? (e.g., Color red)
>>
>> Cheers,
>> Alexandre
>>
>>> On 31 Mar 2021, at 22:01, Buenos Aires Smalltalk <github@fast.org.ar> wrote:
>>>
>>> Mole, a model for graphs, both directed and undirected. reached it's v3.2.0 version.
>>>
>>> Changelog
>>>
>>> • Updated dependencies
>>> • Add Pharo 9 as a supported platform
>>> • Use GitHub actions for the build
>>> Regards,
>>>
>>> The Buenos Aires Smalltalk team
>>>

Replying to:

Empathy v1.0
2021 ©Harmonylists.com