Jump to content

This topic is 6953 days old. Please don't post here. Open a new topic instead.

Recommended Posts

  • Newbies
Posted

I have a datebase for persons. In a portal I can enter relations, i.e to which other persons the actual person has a acquaintanceship.

Example

Debbie knows Martin

Frank <-> Ken

Frank <-> Martin

Rebecca <-> Eddie

Eddie <->Martin

I am looking for a FM solution to the following problem:

For a given person, lets say Debbie, I want to know who is the intermediate to come to another given person, Frank.

In the example above: The solution is Martin

Debbie<->Martin<->Frank

(The next more complex problem would be over 2 intermediates:

example Debbie<->Martin<->Eddie<->Rebecca, but lets first stay for the upper, with only one intermediate.. :

Any hints are appreciated

Posted

Welcome Tiburon,

This is not a simple problem, I'm afraid. You would need to utilize a "shortest path" algorithm, like a BFS (Breadth-First Search.) As the search proceeds, you build the list of intermediaries.

You might start by reading up on how these algorithms work. Once you get the logic figured out, you can implement it in FileMaker.

Posted

Is this like the six-degree of separation problem?

http://www.fmforums.com/forum/showtopic.php?tid/170127/post/177112/hl/sixdegrees/#177112

Posted

Ha! I totally forgot about that. You'd think I'd remember since I provided the solution (a solution that doesn't use a shortest-path algorithm.) Go figure...

This topic is 6953 days old. Please don't post here. Open a new topic instead.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.