Exercise 9 Task 1

Mario Trageser
Windoof-User
Windoof-User
Beiträge: 40
Registriert: 20. Jul 2013 14:28

Exercise 9 Task 1

Beitrag von Mario Trageser » 17. Jan 2018 12:30

Hi,

can we assume, that we have a graph without cycles, so that each node can be seen as the root of a sub graph?
Is it allowed, that a val in a trait is annotated with @ParentAccess? Or doesn't a val count as a method?

Kind regards,
Mario

meichholz
Endlosschleifenbastler
Endlosschleifenbastler
Beiträge: 167
Registriert: 30. Mär 2016 08:28

Re: Exercise 9 Task 1

Beitrag von meichholz » 19. Jan 2018 17:04

Hi,
Mario Trageser hat geschrieben:
17. Jan 2018 12:30
Hi,

can we assume, that we have a graph without cycles, so that each node can be seen as the root of a sub graph?
No, the graph can contain cycles.
Mario Trageser hat geschrieben:
17. Jan 2018 12:30
Is it allowed, that a val in a trait is annotated with @ParentAccess? Or doesn't a val count as a method?
@ParentAccess on a val is not okay, since the structure may change.

Best,
Matthias

LorenzB
Windoof-User
Windoof-User
Beiträge: 28
Registriert: 1. Sep 2015 12:27

Re: Exercise 9 Task 1

Beitrag von LorenzB » 19. Jan 2018 18:30

meichholz hat geschrieben:
19. Jan 2018 17:04
Mario Trageser hat geschrieben:
17. Jan 2018 12:30
can we assume, that we have a graph without cycles, so that each node can be seen as the root of a sub graph?
No, the graph can contain cycles.
I think "with cycles" means that there is no Container which contains itself, is that true?

meichholz
Endlosschleifenbastler
Endlosschleifenbastler
Beiträge: 167
Registriert: 30. Mär 2016 08:28

Re: Exercise 9 Task 1

Beitrag von meichholz » 22. Jan 2018 11:06

Hi,
LorenzB hat geschrieben:
19. Jan 2018 18:30
I think "with cycles" means that there is no Container which contains itself, is that true?
Yes, that's true.

Best,
Matthias

Antworten

Zurück zu „Archiv“