forked from ParkerICI/vite
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbuild_graph.Rd
23 lines (21 loc) · 918 Bytes
/
build_graph.Rd
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/unsupervised.R
\name{build_graph}
\alias{build_graph}
\title{Builds a graph from a data.frame of nodes}
\usage{
build_graph(tab, col.names, filtering_T = 0.8)
}
\arguments{
\item{tab}{A \code{data.frame} of graph nodes. All the columns of \code{tab} will become vertex properties of the output graph}
\item{col.names}{A character vector indicating which columns of \code{tab} should be used to calculate distances}
\item{filtering_T}{The threshold used to filter edges in the graph. If this value is \code{< 1} the edges are filtered based on the
cosine similarity value. If this is an integer \code{>= 1} they are filtered based on rank for each node (i.e. for each node only
the edges with rank less than the threshold are retained)}
}
\value{
Returns an \code{igraph} object
}
\description{
Builds a graph from a data.frame of nodes
}