\HeaderA{closest.transitive.greedy}{Find transitively closed graph most similar to the given one}{closest.transitive.greedy}
\keyword{models}{closest.transitive.greedy}
\begin{Description}\relax
First, from the original graph \eqn{\Phi}{} spurious edges are pruned via
\code{prune.graph}. Then the new graph \eqn{\Phi'}{} is transitively
closed. Afterwards, the algorithms successively introduces new edges
minimizing the distance to the original graph (defined as
\eqn{\sum_{ij} |\Phi_{ij} - \Phi'_{ij}|}{}) most. After each edge
addition the graph is transitively closed again.
\end{Description}
\begin{Usage}
\begin{verbatim}
closest.transitive.greedy(Phi, verbose=TRUE)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{Phi}] adjacency matrix
\item[\code{verbose}] do you want to see progress statements printed or not? Default: TRUE
\end{ldescription}
\end{Arguments}
\begin{Value}
adjacency matrix
\end{Value}
\begin{Author}\relax
Holger Froehlich
\end{Author}
\begin{SeeAlso}\relax
\code{\LinkA{prune.graph}{prune.graph}, \bsl{}code\{\LinkA{prune.graph}{prune.graph}\}, \bsl{}code\{\LinkA{prune.graph}{prune.graph}\}}
\end{SeeAlso}

