Graph factory operations

[Blemicek]

Graph factory should provide more operations: At least finding of a path between objects and maybe a specialized method for finding neighboring objects.

[gbread]

There is already a method for finding neighbors isnt it?
getGraphFromObject with depth set to 1.

[Blemicek]

Yes, you are right, but is the general version same efficient as a specialized one?

[tamhd]

Does this changes affect any method to access database? :)

On 13 April 2014 10:45, Blemicek notifications@github.com wrote:

Yes, you are right, but is the general version same efficient as a
specialized one?

Reply to this email directly or view it on GitHubhttps://github.com//issues/21#issuecomment-40302654
.

[gbread]

@Blemicek: Yes it is, actually using this method with any depth > 1 is highly inefficient 😢
BTW: I found that "finding of a path between objects" is in optional requirements 😄
So I will mark this one as priority low and requirement:optional if u agree.

@tamhd: I dont think so. This is about GraphFactory class.

[Blemicek]

@gbread: ok.