| http://www.w3.org/ns/prov#value | - Another example of a more complex method that may be used is described by Frank Stengel (Detecting cycles in directed graphs). [0110] In another embodiment, since P is a directed acyclic graph (DAG), an edge may be temporarily deleted from the graph.
|
