Route between two nodes in a directed graph

Problem

Given a directed graph, design an algorithm to find out whether there is a route between two nodes.
Example input:
graph:
A --- B
|     |
C --- D
start node: A
end node: D
Example output:
true

Solution

This solution is in C#. Our A.I. can create solutions in multiple languages.

kayakane

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace InterviewPreperationGuide.Core.CrackingTheCodingInterview.c4q1 {
    public class Solution {
        public void Init () {
            Console.WriteLine ();
        }
    }
}