Retrieve all simple paths in a graph

public ICollection<MyObject[]> FindPaths(MyObject sourceObject, MyObject targetObject)
{
    ICollection<MyObject[]> paths = new Collection<MyObject[]>();

    Stack<MyObject> visited = new Stack<MyObject>();
    visited.Push(sourceObject);

    AllSimplePathsDepthFirstSearch(visited, targetObject, paths);

    return paths;
}

private void AllSimplePathsDepthFirstSearch(Stack<MyObject> visited, MyObject target, ICollection<MyObject[]> paths)
{
    MyObject lastVisited = visited.Peek();

    //Explore adjacent edges
    IEnumerable<TaggedEquatableEdge<MyObject, MyRelation> edges = _graph.AdjacentEdges(lastVisited);
    foreach (TaggedEquatableEdge<MyObject, MyRelation> edge in edges)
    {
        MyObject linkedVertice = lastVisited == edge.Source ? edge.Target : edge.Source;
        if (visited.Contains(linkedVertice))
        {
            continue;
        }
        else if (linkedVertice.Equals(target))
        {
            visited.Push(linkedVertice);
            paths.Add(visited.ToArray().Reverse().ToArray());
            visited.Pop();
            continue;
        }
        visited.Push(linkedVertice);
        AllSimplePathsDepthFirstSearch(visited, target, paths);
        visited.Pop();
    }
}