Introduced function AcyclicGraphTake, which accepts a directed, acyclic graph as well as a list of two vertices in that graph, returning the intersection of the out-component of the first vertex in the list with the in-component of the second vertex in the list.
Comments
Still need to write the documentation and verification tests.
Have created tests for when the function is unevaluated, but need help in writing the verification tests because the function should return a Graph.
The testUnevaluated tests in which I am generating a random graph return a failure when actually the error message is the one to be expected. I think this has to do with the fact that the resulting full expression of the error message is returned literally and not as a Graph itself and so SameQ doesn't work.
Changes
Introduced function AcyclicGraphTake, which accepts a directed, acyclic graph as well as a list of two vertices in that graph, returning the intersection of the out-component of the first vertex in the list with the in-component of the second vertex in the list.
Comments
Graph.testUnevaluatedtests in which I am generating a random graph return a failure when actually the error message is the one to be expected. I think this has to do with the fact that the resulting full expression of the error message is returned literally and not as aGraphitself and soSameQdoesn't work.This change is