Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add r_ril_c #65

Merged
merged 3 commits into from
Jul 30, 2024
Merged

Add r_ril_c #65

merged 3 commits into from
Jul 30, 2024

Conversation

Timisorean
Copy link
Contributor

@Timisorean Timisorean commented Jul 19, 2024

Adding a new role: r_til_c(Role, Concept).

This role finds and stores the shortest path of every object to an object from concept C following a role R.

For example, we have a symmetric role connected = {(A, B) | A in {1,2,3}, B in {1,2} and a is A non-diagonal neighbor of B} which describes a 3x2 grid, and concept goal := {1_1, 1_3}:

1_1 | 1_2 | 1_3
---------------
2_1 | 2_2 | 2_3

Then r_til_c(connected, goal) = {(1_2, 1_1), (1_2, 1_3), (2_1, 1_1), (2_2, 2_1), (2_2, 1_2), (2_2, 2_3), (2_3, 1_3)}. For cells 1_2, 2_1 and 2_3 there is only one shortest path to the nearest goal cell. For 2_2 there are four paths over three successor with minimal lengths to a goal cell.

  • Maybe check if there is an faster implementation of the path finding algorithm
  • Check if generator of role is correct / good.

@drexlerd drexlerd merged commit 1d60a5a into rleap-project:main Jul 30, 2024
7 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants