Java Programming

Hi, I am having a problem with finding the articulation points in a unidirected graph, basically, I find the right ones, but I am finding additional points that shouldnt be there..

I am using an adjacency list, I dont know whats wrong.. I have been debugging for hours but to no avail

Anyhelp appreciated

Sample Input:

A-B E-F
| | | |
D-C--H-G


Output:
Found: C
Found: H
Found: A <- Wrong


The vertex class is nothing more than a class with the 4 variables
private int dfs_num, dfs_low, parent, id;
dfs_num will be set to -1 to show that it is not visited

Thanks

Removed Code