Search Results for "graphs"

...Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. Dynamic linear hash tables are implemented too. The main algorithms on graphs are implemented in an easy way and with good performance features. Network Flow (maximum and min cost), cut points, topological sort, spanning trees, min paths. etc. The graphs are generic in the sense that they can contain data independent of the algorithm. Several containers of the C++ STL library are implemented with Aleph-w. ...

The key difference with current graph deep learning libraries, such as PyTorch Geometric (PyG) and Deep Graph Library (DGL), is that, while PyG and DGL support basic graph deep learning operations, DIG provides a unified testbed for higher level, research-oriented graph deep learning tasks, such as graph generation, self-supervised learning, explainability, 3D graphs, and graph out-of-distribution. If you are working or plan to work on research in graph deep learning, DIG enables you to develop your own methods within our extensible framework, and compare with current baseline methods using common datasets and evaluation metrics without extra efforts. It includes unified implementations of data interfaces, common algorithms, and evaluation metrics for several advanced tasks. ...

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

MPAndroidChart is a powerful chart library for Android that offers a beautiful and comprehensive range of charts and graphs. Powerful and very easy to use, it supports the creation of bar-, line-, pie-, bubble-, scatter-, radar- and candlestick charts, as well as scaling, dragging and animations. Charts are rendered cleanly and are visually engaging. Visualizing your data exactly how you want is so much easier with MPAndroidChart. To see more great examples of MPAndroidChart, download the MPAndroidChart Example App on Google Play.

Quantum walk library is set of tools for simulations of quantum walks (for chiral or achiral particles) on graphs based on Zarja library.

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 ).

Java library for graphs

This project aims to be a repository of most popular data structures written in C# language, like stacks, queues, lists, linked lists, heaps, graphs, trees, etc.

libstigg is a library to work with simple though intuitive generic graphs. It is written in Vala/Genie and thus compiles to a standard-linkable GObject library with headers to include from C.

An efficient and easy-to-use C++ library containing classes to represent and manipulate graphs and digraphs. Additional vertex and edge/arc property structures are provided that can be synchronized with the graph structure dynamically.

Netflow analyzing tools : JXColl - collector for Netflow (or XML specified) data Analyzer - front-end application for providing an user interface and output (graphs, statistics, etc.)