Graph oriented programming and execution. According to one embodiment of the invention, execution of a program includes automatically discovering and building a graph. The graph is to represent parent child relationships between combinations. Each combination is a specific method and a specific object-oriented instance. Based on a first of the combinations, other combinations are determined by iteratively discovering the child combinations for already discovered parent combinations. The graph is built of nodes coupled with links. Each of the plurality of combinations is identified by one of the nodes. Each of the parent child relationships is represented by one of the links. Execution of the program also includes executing the graph in an order indicated by the links until the root node is reached. Execution of each of the parent nodes includes executing the combination identified by that parent node to generate an output using the outputs of its child node(s).