find.segments: find.segments
In antongrau/MONECA: Mobility Network Clustering Analysis

An algorithm for creating discrete groups or segments on the basis of a weighted network and a mobility table

1 2	find.segments(mat, cliques, cut.off = 1, mode = "symmetric", delete.upper.tri = TRUE)

`mat`	is the mobility table with row and column margins
`cliques`	is a list of cliques
`cut.off`	is the minimum weight or relative risk accepted as a network tie
`mode`	defines whether mat is symmetric. If mode is "Mutual" - ties are only created for mutual relations. If mode is "Unmutual", relations are not required to be mutual to result in a tie.
`delete.upper.tri`	defines whether the upper triangle of the matrix is to be deleted. This results in speed gains.