| Implementing Warshall's algorithm within Viatra [message #984446] |
Wed, 14 November 2012 18:02 |
 Rafael Ribeiro Rezende
Messages: 1
Registered: November 2012 |
Junior Member |
|
|
Hi, I'm new to Viatra (and to this forum as well) and I have a simple question about what can be done within Viatra.
Basically, I have an UML Object Diagram representing a network topology. Every class, from which the objects are instantiated, is stereotyped with network and dependability properties.
Well, I need to extract a part of the topology which contains all the possible paths (links and nodes) between two given nodes. These paths can be extracted with Floyd-Warshall algorithm, for instance.
Is it possible to perform this completely within Viatra? Or I need to first extract a graph out of UML Object Diagram to feed an external tool that performs the algorithm?
Thanks in advance!
|
|
|
Powered by
FUDForum. Page generated in 0.02900 seconds
] 
Search
Help
Register
Login
Home
