{"action":"closed","issue":{"url":"https://api.github.com/repos/FubarDevelopment/QuickGraph/issues/161","repository_url":"https://api.github.com/repos/FubarDevelopment/QuickGraph","labels_url":"https://api.github.com/repos/FubarDevelopment/QuickGraph/issues/161/labels{/name}","comments_url":"https://api.github.com/repos/FubarDevelopment/QuickGraph/issues/161/comments","events_url":"https://api.github.com/repos/FubarDevelopment/QuickGraph/issues/161/events","html_url":"https://github.com/FubarDevelopment/QuickGraph/issues/161","id":331525751,"node_id":"MDU6SXNzdWUzMzE1MjU3NTE=","number":161,"title":"CP-304: Critical Path","user":{"login":"fubar-coder","id":4739844,"node_id":"MDQ6VXNlcjQ3Mzk4NDQ=","avatar_url":"https://avatars3.githubusercontent.com/u/4739844?v=4","gravatar_id":"","url":"https://api.github.com/users/fubar-coder","html_url":"https://github.com/fubar-coder","followers_url":"https://api.github.com/users/fubar-coder/followers","following_url":"https://api.github.com/users/fubar-coder/following{/other_user}","gists_url":"https://api.github.com/users/fubar-coder/gists{/gist_id}","starred_url":"https://api.github.com/users/fubar-coder/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/fubar-coder/subscriptions","organizations_url":"https://api.github.com/users/fubar-coder/orgs","repos_url":"https://api.github.com/users/fubar-coder/repos","events_url":"https://api.github.com/users/fubar-coder/events{/privacy}","received_events_url":"https://api.github.com/users/fubar-coder/received_events","type":"User","site_admin":false},"labels":[{"id":961499436,"node_id":"MDU6TGFiZWw5NjE0OTk0MzY=","url":"https://api.github.com/repos/FubarDevelopment/QuickGraph/labels/component:algorithms","name":"component:algorithms","color":"f6d612","default":false},{"id":961517316,"node_id":"MDU6TGFiZWw5NjE1MTczMTY=","url":"https://api.github.com/repos/FubarDevelopment/QuickGraph/labels/priority:Medium","name":"priority:Medium","color":"f97923","default":false}],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":1,"created_at":"2018-06-12T10:17:18Z","updated_at":"2018-06-12T10:19:31Z","closed_at":"2018-06-12T10:19:31Z","author_association":"CONTRIBUTOR","body":"*Form unknown CodePlex user on Sunday, 13 May 2007 12:31:53*\n\nIt is a DAG. I build a database schema representation as a graph. Vertexes are tables, edges are foreign key constraints.\n \nI'm really illiterate on graph theory, hence why I'm asking if there is a way to find the critical path using the existing framework or if I have to modify one of the algorithms (DijkstraShortestPathAlgorithm perhaps) to do this. A DAG exactly represents my problem hence why I chose it.\n \nAs for the exact path, won't the DFS algorithm give me the shortest path to a node? Assuming, that I have multiple paths to a node, I need the critical path, not the shortest path.\n \nThank you.\n \n-Nick"}}
{"actor":{"display_login":"fubar-coder"}}