Dr. rer. nat. Steffen Zschaler AHEA
Senior Lecturer
King's College London
Department of Informatics
Email szschaler@xxxxxxx
Phone +44 (020) 7848 1513
WWW http://www.steffen-zschaler.de/
Thank you for your immediate answer.
I see, I did not declare my matter clearly. Sorry for that.
Sure I can match that by explicitly define a rule where Class1 is connected to exactly 2 Class2.
What I had in my was more in the direction by making it some kind of generic with for example attribute conditions and input parameters.
Sorry for the inconvenience. I hope now it's clearer what I meant.
Arbeitsgruppe Ähnlichkeitsmechanik
Telefon: +49 (0)711 685 69530
Institut für Statik und Dynamik der Luft- und Raumfahrtkonstruktionen
Pfaffenwaldring 27 - Zimmer 01.002
On Thu, 2017-10-26 at 12:34 +0000, Zschaler, Steffen wrote:
That’s exactly what Graph Rules are for. You can just write down exactly the situation that you are after.
Steffen
Hello Henshin users and developers,
I just wanted to ask if it possible to construct matching rules which match certain patterns dependent on their number of connected edges?
Class1 connected to 3 Class2.
Class1 connected to 2 Class2.
Now I want my rules only to match the pattern where Class1 only has 2 Class2 members.
--
Arbeitsgruppe Ähnlichkeitsmechanik
Telefon: +49 (0)711 685 69530
Institut für Statik und Dynamik der Luft- und Raumfahrtkonstruktionen
Pfaffenwaldring 27 - Zimmer 01.002
_______________________________________________
henshin-user mailing list
henshin-user@xxxxxxxxxxx
To change your delivery options, retrieve your password, or unsubscribe from this list, visit
https://dev.eclipse.org/mailman/listinfo/henshin-user