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

[Documentation] Questions concerning MatchAdapter #35

Open
anthonyanjorin opened this issue Oct 4, 2019 · 4 comments
Open

[Documentation] Questions concerning MatchAdapter #35

anthonyanjorin opened this issue Oct 4, 2019 · 4 comments
Labels
brainstorming Brainstorming for future features/changes enhancement New feature or request

Comments

@anthonyanjorin
Copy link
Collaborator

I'm creating this as an issue so you know what questions your JavaDoc documentation should answer...

Concerning the getGraph method for MatchAdapters:

  1. Do I have to build the entire graph consisting of both rule and match?
  2. Domain and action for match nodes/edges is rather weird... Isn't this clear from the corresponding rule nodes?
  3. What does neighbourhoodSize mean?
@anthonyanjorin anthonyanjorin added the question Issue requires further info to be classed correctly label Oct 4, 2019
@LegionaryCohort
Copy link

I've added some explainations to the Javadocs regarding these questions.

However, regarding number 2:
Victory's new visualisation system is quite flexible in that it simply displays whatever the adapter tells it to display. This provides a lot of flexibility when building graphs, allowing for example semi-dangling edges (i.e. edges that have a src and trg node, but those nodes are not necessarily both part of the node-set of the graph). However, the downside of this is that it is necessary to specify the domain and action explicitly, as Victory will not derive them automatically from relationships between nodes that go beyond simple graph information.

I'm not sure where to put this information in the Javadocs however. Perhaps in the docs for the Graph API?

@anthonyanjorin
Copy link
Collaborator Author

Yes, the Graph API would make sense.

Something I found confusing: Victory doesn't seem to distinguish between "rule" graphs, and "model" graphs. This means that model (match) graphs have properties (action) that don't really make sense... You should explain in the API how this stuff is handled (or perhaps introduce RuleGraph, ModelGraph? Or throw an exception?). Domains for model graphs is also strange (as it is more a rule concept -- some crazy tool might match source and target rule variables to the same model element).

I agree, however, that simplicity is great... and the visualisation should not pose too many clever restrictions.

@LegionaryCohort
Copy link

LegionaryCohort commented Oct 7, 2019

Yes, Victory only knows graphs that have nodes and edges, and it offers a number of ways to customize how those nodes and edges are drawn. If we were very precise, then Victory shouldn't really have any concept of Domain or Action at all, as they are just indicators for the coloring of background and foreground, respectively.

Ideally Victory should just ask the adapter for the foreground and background color of each node, and then the adapter can deal with concepts like domain and action, but I don't think that's a change we can get implemented properly by tomorrow.

@anthonyanjorin
Copy link
Collaborator Author

Final conclusion: it would be nice to use terms like "BackgroundColour", "ForegroundColour", etc as opposed to "Domain" and "Action"...

@anthonyanjorin anthonyanjorin added brainstorming Brainstorming for future features/changes enhancement New feature or request and removed question Issue requires further info to be classed correctly labels Nov 29, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
brainstorming Brainstorming for future features/changes enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

4 participants