Search Results for "squid-graph"

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.

Graph making software which is available for free.

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

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

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.

Aim is to extract the information from the cadastral maps which is stored as scanned images. The extracted information is stored using graph representation. Then we convert these infomation in to CityGML format to visualize and communicate.

GraphLab provides a rich environment for researchers in Graph Theory field. The project page has moved to http://graphlab.sharif.ir

Common utility code to support a number of projects. Examples of the supported areas: DTOs, ACID supporting attributes and object graph, simple XML interpretation, uisupport, remoteing support, ...

Graph Package (GPack) is a solution for developing simple graphics in Delphi environment. GPack includes 2 components TGraph & TGraph3D which help users to create 2D/3D graphic applications in an easiest and quickest way.

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