pub struct CliArgs {Show 14 fields
pub src: PathBuf,
pub perm: Option<PathBuf>,
pub work_dir: Option<PathBuf>,
pub epserde: bool,
pub gammas: Vec<String>,
pub max_updates: usize,
pub modified: bool,
pub perc_modified: Option<f64>,
pub gain_threshold: f64,
pub improv_threshold: f64,
pub num_threads: NumThreadsArg,
pub seed: u64,
pub granularity: GranularityArgs,
pub chunk_size: Option<usize>,
}
Fields§
§src: PathBuf
The basename of the graph.
perm: Option<PathBuf>
A filename for the LLP permutation in binary big-endian format. If not
provided, we will compute the labels but not combine them into the final
permutation. If you don’t set this parameter, be sure to set work_dir
so the labels will not be deleted at the end.
work_dir: Option<PathBuf>
The folder where the LLP labels are stored. If not specified, a temp
dir will be used which will be deleted at the end of the computation.
The temp dir parent folder can be specified with the TMPDIR environment
variable.
Setting a work_dir has two purposes: saving the information they
compute and to be able to resume the computation of gammas as their
computation on large graphs might take days.
The labels represent information about communities in the graph, nodes
similar will have the same label.
To resume computation you can compute the remaining gammas without
passing perm
, and then finally run combine
that will combine all the
labels of the gammas present in the folder into a final permutation.
epserde: bool
Save the permutation in ε-serde format.
gammas: Vec<String>
The ɣ’s to use in LLP, separated by commas. The format is given by a integer numerator (if missing, assumed to be one), a dash, and then a power-of-two exponent for the denominator. For example, -2 is 1/4, and 0-0 is 0.
max_updates: usize
If specified, the maximum number of updates for a given ɣ.
modified: bool
If true, updates will be stopped when the number of modified nodes is less than the square root of the number of nodes of the graph.
perc_modified: Option<f64>
If true, updates will be stopped when the number of modified nodes is less than the specified percentage of the number of nodes of the graph.
gain_threshold: f64
The gain threshold used to stop the computation (0 to disable).
improv_threshold: f64
The threshold on the average (over the last ten updates) gain improvement used to stop the computation (-Inf to disable).
num_threads: NumThreadsArg
§seed: u64
The seed to use for the PRNG.
granularity: GranularityArgs
§chunk_size: Option<usize>
The chunk size used to localize the random permutation (advanced option).
Trait Implementations§
Source§impl Args for CliArgs
impl Args for CliArgs
Source§fn augment_args<'b>(__clap_app: Command) -> Command
fn augment_args<'b>(__clap_app: Command) -> Command
Source§fn augment_args_for_update<'b>(__clap_app: Command) -> Command
fn augment_args_for_update<'b>(__clap_app: Command) -> Command
Command
so it can instantiate self
via
FromArgMatches::update_from_arg_matches_mut
Read moreSource§impl CommandFactory for CliArgs
impl CommandFactory for CliArgs
Source§impl FromArgMatches for CliArgs
impl FromArgMatches for CliArgs
Source§fn from_arg_matches(__clap_arg_matches: &ArgMatches) -> Result<Self, Error>
fn from_arg_matches(__clap_arg_matches: &ArgMatches) -> Result<Self, Error>
Source§fn from_arg_matches_mut(
__clap_arg_matches: &mut ArgMatches,
) -> Result<Self, Error>
fn from_arg_matches_mut( __clap_arg_matches: &mut ArgMatches, ) -> Result<Self, Error>
Source§fn update_from_arg_matches(
&mut self,
__clap_arg_matches: &ArgMatches,
) -> Result<(), Error>
fn update_from_arg_matches( &mut self, __clap_arg_matches: &ArgMatches, ) -> Result<(), Error>
ArgMatches
to self
.Source§fn update_from_arg_matches_mut(
&mut self,
__clap_arg_matches: &mut ArgMatches,
) -> Result<(), Error>
fn update_from_arg_matches_mut( &mut self, __clap_arg_matches: &mut ArgMatches, ) -> Result<(), Error>
ArgMatches
to self
.Source§impl Parser for CliArgs
impl Parser for CliArgs
Source§fn parse_from<I, T>(itr: I) -> Self
fn parse_from<I, T>(itr: I) -> Self
Source§fn try_parse_from<I, T>(itr: I) -> Result<Self, Error>
fn try_parse_from<I, T>(itr: I) -> Result<Self, Error>
Source§fn update_from<I, T>(&mut self, itr: I)
fn update_from<I, T>(&mut self, itr: I)
Auto Trait Implementations§
impl Freeze for CliArgs
impl RefUnwindSafe for CliArgs
impl Send for CliArgs
impl Sync for CliArgs
impl Unpin for CliArgs
impl UnwindSafe for CliArgs
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T, U> CastableInto<U> for Twhere
U: CastableFrom<T>,
impl<T, U> CastableInto<U> for Twhere
U: CastableFrom<T>,
Source§impl<T, U> CastableInto<U> for Twhere
U: CastableFrom<T>,
impl<T, U> CastableInto<U> for Twhere
U: CastableFrom<T>,
Source§impl<T> DowncastableFrom<T> for T
impl<T> DowncastableFrom<T> for T
Source§fn downcast_from(value: T) -> T
fn downcast_from(value: T) -> T
Source§impl<T> DowncastableFrom<T> for T
impl<T> DowncastableFrom<T> for T
Source§fn downcast_from(value: T) -> T
fn downcast_from(value: T) -> T
Source§impl<T, U> DowncastableInto<U> for Twhere
U: DowncastableFrom<T>,
impl<T, U> DowncastableInto<U> for Twhere
U: DowncastableFrom<T>,
Source§impl<T, U> DowncastableInto<U> for Twhere
U: DowncastableFrom<T>,
impl<T, U> DowncastableInto<U> for Twhere
U: DowncastableFrom<T>,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more