why is it 2n-1? I think 2n-1=1²+2²+...+n².Segregating interfaces should not be overdone!
If you overdue the application of the interface segregation principle, you will end up with 2n-1 interfaces
for a class with n methods.
Thank you
why is it 2n-1? I think 2n-1=1²+2²+...+n².Segregating interfaces should not be overdone!
If you overdue the application of the interface segregation principle, you will end up with 2n-1 interfaces
for a class with n methods.
mean in the case of Scala?a modifiable (i.e. it supports add and remove) list of tasks
I think "with cycles" means that there is no Container which contains itself, is that true?meichholz hat geschrieben: ↑19. Jan 2018 17:04No, the graph can contain cycles.Mario Trageser hat geschrieben: ↑17. Jan 2018 12:30can we assume, that we have a graph without cycles, so that each node can be seen as the root of a sub graph?