A Simplistic way to Ensure that the Order of Component Loading Adheres to the Component Dependency Graph

Let us suppose that there's a graph that has been encoded in the classical manner, as shown in the following image. The first row of the table means that A depends on D and F. The second row means that B depends on C, and so on and so forth. The empty and black compartments denote lack of dependence.

If array[0] is the first component to be loaded, then in the case of this example,

      array[0]==G
      array[1]==F
      array[2]==E,
      

etc.