Search Results for "path-setting"

...CiteSpace also supports basic visual analytic functions for datasets without citation-related information, for example, PubMed, CNKI, ProQuest Dissertations and Theses. CiteSpace reveals how a field of research has evolved, what intellectual turning points are evident along a critical path, and what topics have attracted attention. CiteSpace can be applied repeatedly so as to track the development of a field closely and extensively. The e-book How to Use CiteSpace explains the design principles and functions along with illustrative examples in more detail: https://leanpub.com/howtousecitespace

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

This program allows to draw diagrams with chart library, that can be used with dialog applications, based on the RC files designers (such as FbEdit for example). This is the one of the fastest way to create window application with visual design methods, and implement into it an ellegant and flexible chart, that can be choosen from four different diagram kinds (if you edit code and use it in your projects). The source code chart library by Lothar Schirm is based on the consolidated...

Chemin optimal allows to draw nodes on a scene and link them with Arcs. You can affect values to each arc (the path's length). By clicking the launch button, chemin optimal show you the optimal path of the graphs using FORD algorithm. All operations are shown step by step. You can export the scene to a XML file. You can also load scene freom existing XML file. Chemin optimal check errors automatically before finding the minimal path. Chemin optimal is written in JAVA( JAVAFX ).

*nts* provides a simple format for using text files to store notes, a command line interface for viewing notes in a variety of convenient ways and a cross-platform, wx(python)-based GUI for creating and modifying notes as well as viewing them.

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G