An algorithm is described which generates without duplication and with appropriate sign all the trees of a graph containing directed elements. A path-finding algorithm is extended in an application of Mason´s method of expansion of paths.
Keywords :
Algorithm design and analysis; Application software; Computer networks; Heart; Resistors; Testing; Tree graphs; Visualization;
