search

PreXident / TextAn

MFF automaticky policejni analytik
Other
4 stars 3 forks source link

Graph factory operations #21

Open Blemicek opened 10 years ago

Blemicek commented 10 years ago

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

gbread commented 10 years ago

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

Blemicek commented 10 years ago

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

tamhd commented 10 years ago

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/PreXident/TextAn/issues/21#issuecomment-40302654 .

gbread commented 10 years ago

@Blemicek: Yes it is, actually using this method with any depth > 1 is highly inefficient :cry: BTW: I found that "finding of a path between objects" is in optional requirements :smile: 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 commented 10 years ago

@gbread: ok.