{"action":"created","issue":{"url":"https://api.github.com/repos/clientIO/JointJS_plus/issues/54","labels_url":"https://api.github.com/repos/clientIO/JointJS_plus/issues/54/labels{/name}","comments_url":"https://api.github.com/repos/clientIO/JointJS_plus/issues/54/comments","events_url":"https://api.github.com/repos/clientIO/JointJS_plus/issues/54/events","html_url":"https://github.com/clientIO/JointJS_plus/issues/54","id":59657450,"number":54,"title":"Path finder algorithm in BPMN","user":{"login":"JoseGoncalves","id":3037740,"avatar_url":"https://avatars.githubusercontent.com/u/3037740?v=3","gravatar_id":"","url":"https://api.github.com/users/JoseGoncalves","html_url":"https://github.com/JoseGoncalves","followers_url":"https://api.github.com/users/JoseGoncalves/followers","following_url":"https://api.github.com/users/JoseGoncalves/following{/other_user}","gists_url":"https://api.github.com/users/JoseGoncalves/gists{/gist_id}","starred_url":"https://api.github.com/users/JoseGoncalves/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/JoseGoncalves/subscriptions","organizations_url":"https://api.github.com/users/JoseGoncalves/orgs","repos_url":"https://api.github.com/users/JoseGoncalves/repos","events_url":"https://api.github.com/users/JoseGoncalves/events{/privacy}","received_events_url":"https://api.github.com/users/JoseGoncalves/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":1,"created_at":"2015-03-03T15:29:09Z","updated_at":"2015-04-30T15:29:21Z","closed_at":null,"body":"A common use case in a BPMN diagram is to find paths between a set of activities.\r\nI would like to request that you add an algorithm to Rappid that could provide an easy (and efficient) way to calculate this. As an example for what is needed take a look to the following diagram:\r\n![bpmn_path](https://cloud.githubusercontent.com/assets/3037740/6465535/a2bd42ba-c1b9-11e4-886d-526310d0b6c3.png)\r\nThe red higllighted path is the output for this algorithm given as input activities A, C and D.\r\n"},"comment":{"url":"https://api.github.com/repos/clientIO/JointJS_plus/issues/comments/97839365","html_url":"https://github.com/clientIO/JointJS_plus/issues/54#issuecomment-97839365","issue_url":"https://api.github.com/repos/clientIO/JointJS_plus/issues/54","id":97839365,"user":{"login":"DavidDurman","id":125717,"avatar_url":"https://avatars.githubusercontent.com/u/125717?v=3","gravatar_id":"","url":"https://api.github.com/users/DavidDurman","html_url":"https://github.com/DavidDurman","followers_url":"https://api.github.com/users/DavidDurman/followers","following_url":"https://api.github.com/users/DavidDurman/following{/other_user}","gists_url":"https://api.github.com/users/DavidDurman/gists{/gist_id}","starred_url":"https://api.github.com/users/DavidDurman/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/DavidDurman/subscriptions","organizations_url":"https://api.github.com/users/DavidDurman/orgs","repos_url":"https://api.github.com/users/DavidDurman/repos","events_url":"https://api.github.com/users/DavidDurman/events{/privacy}","received_events_url":"https://api.github.com/users/DavidDurman/received_events","type":"User","site_admin":false},"created_at":"2015-04-30T15:29:20Z","updated_at":"2015-04-30T15:29:20Z","body":"This is now partially implemented in the `shortestPath()` method of the `dia.GraphUtils` plugins (http://jointjs.com/rappid/docs/dia/graphUtils). However, this could be extended with another method for finding *all* the paths, not only the shortest one."}}