\HeaderA{transitive.projections}{Computes the transitive approximation of a directed graph}{transitive.projections}
\aliasA{CheckEdge}{transitive.projections}{CheckEdge}
\aliasA{distdecrease}{transitive.projections}{distdecrease}
\aliasA{distincrease}{transitive.projections}{distincrease}
\aliasA{distincrease1}{transitive.projections}{distincrease1}
\aliasA{distsame}{transitive.projections}{distsame}
\aliasA{EdgeEk}{transitive.projections}{EdgeEk}
\aliasA{FourNeighborhood}{transitive.projections}{FourNeighborhood}
\aliasA{is.transitive}{transitive.projections}{is.transitive}
\aliasA{OneNeighborhood}{transitive.projections}{OneNeighborhood}
\aliasA{remTwoEdges}{transitive.projections}{remTwoEdges}
\aliasA{ThreeNeighborhood}{transitive.projections}{ThreeNeighborhood}
\aliasA{transSubGr}{transitive.projections}{transSubGr}
\aliasA{TwoNeighborhood}{transitive.projections}{TwoNeighborhood}
\aliasA{VecToMat}{transitive.projections}{VecToMat}
\keyword{graphs}{transitive.projections}
\begin{Description}\relax
Computes the transitive approximation of a graph. The transitive approximation of a graph is a graph that is "almost" transitively closed and has minimal distance to the input graph.
\end{Description}
\begin{Usage}
\begin{verbatim}
transitive.projections(adjmat)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{adjmat}] graphNEL object or adjacency matrix.
\end{ldescription}
\end{Arguments}
\begin{Value}
returns adjacency matrices and having minimal graph distance to the input graph matrix
\end{Value}
\begin{Author}\relax
Juby Jacob
\end{Author}
\begin{SeeAlso}\relax
\code{\LinkA{transitive.projections}{transitive.projections}}
\end{SeeAlso}

