Skip to main content

Eclipse Community Forums
Forum Search:

Search      Help    Register    Login    Home
Home » Newcomers » Newcomers » Implementing Warshall's algorithm within Viatra
Implementing Warshall's algorithm within Viatra [message #984446] Wed, 14 November 2012 18:02
Rafael Ribeiro Rezende is currently offline Rafael Ribeiro RezendeFriend
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!
Previous Topic:Build path selection list
Next Topic: Problems occurred during save.
Goto Forum:

Current Time: Wed Jan 19 20:02:00 GMT 2022

Powered by FUDForum. Page generated in 0.03309 seconds
.:: Contact :: Home ::.

Powered by: FUDforum 3.0.2.
Copyright ©2001-2010 FUDforum Bulletin Board Software

Back to the top