Concurrent Modeling with Subversion (SVN)
With VP-UML's concurrent modeling support, you and your team members can save your work to a central repository (server), and perform concurrent modeling. In this tutorial, we will try out concurrent modeling with subversion server.
| May 5, 2010 | |
User Rating:
/ 0
|
|
| Views: 1,838 | |
|
PDF
Link
Link: |
Add comments |
| Edition: Standard or above (Edition comparison) | |
- Prepare a Subversion server for this tutorial.
- Start Visual Paradigm for UML with workspace C:\vptutorial\workspace.
- We need to create a project in server. Select Tools > Teamwork > Open Teamwork Client... from the main menu.
- In the login dialog box, select Subversion for server and fill in the login details. Click OK to proceed.
- The Manage Project dialog box lets you select the project to work with. We are going to create a new project, so let's click OK to skip this.
- In the Teamwork Click dialog box, click the Import Project to Repository button.
- In the Import Project dialog box, enter My first project to be project name. Select Create new project and click OK.
- Click Open Project at the bottom right corner of Teamwork Client.
- Draw a diagram. Draw whatever you like. Here is an example, which is a class diagram.
- Let's commit the changes to server. Select Tools > Teamwork > Commit...
from the main menu.
- In the Commit dialog box, select some nodes in the tree to check the changes to commit. Then, enter the comment as shown in the image below:
- Click OK to continue with committing.
- The changes are committed to server. Now, draw one more diagram and commit to server again.
- We can re-visit a past revision through the Teamwork Client. Let's try. Open Teamwork Client by selecting Tools > Teamwork > Open Teamwork Client... from the main menu.
- Open the Revisions tab. Select the previous revision and click Open. You should see the class diagram exist in project, but not the use case diagram, as this revision does not have it committed yet.
Rate this Article
Click on one of the stars below to rate this article from 1 (lowest) to 5 (highest).
Comments (0)