{"action":"opened","issue":{"url":"https://api.github.com/repos/jgrapht/jgrapht/issues/172","labels_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/172/labels{/name}","comments_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/172/comments","events_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/172/events","html_url":"https://github.com/jgrapht/jgrapht/issues/172","id":128553871,"number":172,"title":"Bridges and Cut vertices in Directed Graphs","user":{"login":"keshete","id":8776546,"avatar_url":"https://avatars.githubusercontent.com/u/8776546?v=3","gravatar_id":"","url":"https://api.github.com/users/keshete","html_url":"https://github.com/keshete","followers_url":"https://api.github.com/users/keshete/followers","following_url":"https://api.github.com/users/keshete/following{/other_user}","gists_url":"https://api.github.com/users/keshete/gists{/gist_id}","starred_url":"https://api.github.com/users/keshete/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/keshete/subscriptions","organizations_url":"https://api.github.com/users/keshete/orgs","repos_url":"https://api.github.com/users/keshete/repos","events_url":"https://api.github.com/users/keshete/events{/privacy}","received_events_url":"https://api.github.com/users/keshete/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2016-01-25T14:56:43Z","updated_at":"2016-01-25T14:56:43Z","closed_at":null,"body":"Hi,\r\nAre there algorithms for finding bridges and cut vertices (articulation points) in directed graph?\r\nThe only relevant thing I could only find was getCutpoints() in BiconnectivityInspector, but this is for undirected graphs (+it's not all I need).\r\nThanks!"}}