Risk-Aware Code Review: Auto Approve Low-Risk Changes
LiveReview LiveReview LiveReview - Free, Risk-Aware Code Review: Auto Approve Low-Risk Changes | Product Hunt LiveReview - Free, Risk-Aware Code Review: Auto Approve Low-Risk Changes | Product Hunt GitHub Install Now

We'd appreciate a star

tsort - Topological sort the strings in FILE. Strings are defined as any sequence of tokens separated by

Description

       Topological  sort  the  strings  in  FILE.   Strings  are  defined as any sequence of tokens separated by
       whitespace (tab, space, or newline), ordering them based on dependencies  in  a  directed  acyclic  graph
       (DAG).   Useful  for scheduling and determining execution order.  If FILE is not passed in, stdin is used
       instead.

Name

       tsort - Topological sort the strings in FILE.  Strings are defined as any sequence of tokens separated by
       whitespace  (tab,  space,  or  newline),  ordering them based on dependencies in a directed acyclic graph
       (DAG).  Useful for scheduling and determining execution order.  If FILE is not passed in, stdin  is  used
       instead.

Options

-h, --help
              Print help

       -V, --version
              Print version

Synopsis

tsort [-h|--help] [-V|--version] [file]

Version

       v0.0.30

                                                  tsort 0.0.30                                          tsort(1)

See Also