Search Results for "algorithm"

...The formatter can act on whole files, on limited lines, on specific offsets, passing through to standard-out (default) or altered in-place. There is no configurability as to the formatter's algorithm for formatting. This is a deliberate design decision to unify our code formatting on a single format. The formatter can be used in software that generates java to output more legible java code. Just include the library in your maven/gradle/etc. configuration. A google-java-format IntelliJ plugin is available from the plugin repository. ...

...You may specify file suffixes to include or exclude as well as regular expressions for code lines that shall be excluded (e.g. to exclude comments). By default a heuristic algorithm skips binary files. You may configure the restrictiveness of this algorithm with command line options.

Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31 vertices). Since version 1.1, can also compute shortest cycles covering all edges of SCCs. Usage from command line is also possible but with reduced flexibility (cf. ...

This is a tool for concern mining which uses a KDM model as input and the output is the same model with annotated concerns. It uses a Concern Library and a modified String Clustering K-means algorithm with Levenshtein metric to cluster the strings.

[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later.

This is a small program that shows flowchart from C source code . This program may help the user analyze C/C++ source and Assembly(x86,PIC MCU(16fxx,24fxx))code by navigating the flowcharts.