Find bridges in an graph given cut vertices.

Im trying to figure out an algorithm to find bridges in an undirected graph given its cut vertices. Should I use dfs? if so how do I go about determining whether its a bridge or not? I know how to do on paper but not in code.