Search Results for "graph path"

Adrix.NT Java Works :: Sources & Build Projects includes - Paged Lists of Object & Iterators Library for Java - Action / Entity Model for Java - VR Ax AWT Clock Java Component - VR Multi Dimensions Array Library - VR MDArray List Manager Library - VR Adjacency (List | Matrix) Direct Graph Lib - VRJMosaic cells sliding game with automatic resolver - VR RectsWorld Sample Applic - VR Free Chess 2D Applic also contains - Other Utils Libraries - Demo and Test Applications - NetBeans build projects - and more ... (*) note: the libraries folder to build and run applications must be located on the same volume of the java applications its path name must be: \AX.VincentRadio\Java\SharedLib have fun Adrix.NT adrixnt@hotmail.it

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

...Each optimization type is simple and generic, so it doesn't matter what specific type of obfuscation is used. Provides a virtual machine sandbox for executing Dalvik methods. After executing a method, it returns a graph containing all possible register and class values for every execution path. It works even if some values are unknown, such as file and network I/O. For example, any if or switch conditional with an unknown value results in both branches being taken. Analyzes the execution graphs from smalivm and applies optimizations such as constant propagation, dead code removal, unreflection, and some peephole optimizations. ...

JAGAL provides implementations for directed graphs (weighted and unweighted) and varoius types of transition systems as well as utils for graph traversal and modification. JAGAL builds upon the Java library TOVAL (located at http://sourceforge.net/p/toval). To use JAGAL, make sure the TOVAL library is on the build path. This library uses and encloses jGraphX (https://github.com/jgraph/jgraphx). A documentation for JAGAL can be found under http://doku.telematik.uni-freiburg.de/jagal.

A plugin for the Eclipse IDE to generate control flow graphs and show coverage information. Supports node, edge, edge-pair and prime path coverage. Based on the Eclipse Control Flow Graph Generator (http://eclipsefcg.sourceforge.net/)

The Open Optimization for Java provides a framework and the implementation of commonly-used algorithms found in Graph Theory and Network Optimization, e.g. shortest path and postman problem.

Why is a diagnostic visualisation tool driven from stack back-traces. Given a stack backtrace is displays an execution graph containing the source highlighting the execution path and inferring application state from that path.