Search Results for "graph c#"
Sort By:
Showing 47 open source projects for "graph c#"
View related business solutions-
Our Free Plans just got better! | Auth0 by OktaYou asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
-
Start building the next generation of GenAI apps todayMongoDB Atlas is a fully-managed developer data platform built by developers, for developers. With tight integration to Google Cloud services such as Vertex AI and BigQuery, you can accelerate application deployment to stay at the forefront of AI innovation.
-
1
PyTorch Geometric
Geometric deep learning extension library for PyTorch
... of functionality of PyTorch Geometric to other packages, which needs to be additionally installed. These packages come with their own CPU and GPU kernel implementations based on C++/CUDA extensions. We do not recommend installation as root user on your system python. Please setup an Anaconda/Miniconda environment or create a Docker image. We provide pip wheels for all major OS/PyTorch/CUDA combinations. -
2
PyTensor
Python library for defining and optimizing mathematical expressions
PyTensor is a fork of Aesara, a Python library for defining, optimizing, and efficiently evaluating mathematical expressions involving multi-dimensional arrays. PyTensor is based on Theano, which has been powering large-scale computationally intensive scientific investigations since 2007. A hackable, pure-Python codebase. Extensible graph framework is suitable for rapid development of custom operators and symbolic optimizations. Implements an extensible graph transpilation framework... -
3
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
.... OR-Tools is written in C++, but comes with wrappers for Python, C# and Java. Once you model your problem in your preferred programming language, you can then use any of OR-Tools’ available solvers. OR-Tools is an award-winning project, having won three gold medals in the 2020 MiniZinc Challenge, the international constraint programming competition. -
4
Social Network Visualizer
Social Network Analysis and Visualization software
Visit our new site: http://socnetv.org Social Network Visualizer (SocNetV) is a social network analysis and visualization application. You can draw a social network (graph/digraph) or load an existing one (GraphML, UCINET, Pajek, etc), compute cohesion, centrality, community and structural equivalence metrics and apply various layout algorithms based on actor centrality or prestige scores (i.e. Eigenvector, Betweenness) or on dynamic models (i.e. Kamada-Kawai spring-embedder) -
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
5
wxArt2D gives wxWindows applications sophisticated vector drawing functionality. It is based on a framework supporting multiple views within a hierarchical document. Supports drawing & (Graph) editing. In-output in SVG, GDSII, XML, easy to extend.
-
6
gml4gtk
small console GML or graphviz DOT graph viewer
directed graph layout program for GML (Graph-Markup-Language) graph or partial graphviz DOT graph -
7
rw
rw calculates rank-width and rank-decompositions.
rw calculates rank-width and rank-decompositions. It is based on ideas from "Computing rank-width exactly" by Sang-il Oum, "Sopra una formula numerica" by Ernesto Pascal, "Generation of a Vector from the Lexicographical Index" by B.P. Buckles and M. Lybanon and "Fast additions on masked integers" by Michael D. Adams and David S. Wise. On 2009's computers it works quite well up to graph sizes of about 28 nodes. Runtime and memory usage are exponential in the graph size. -
8
lnlc
lnlc calculates linear nlc-width and corresponding expressions
lnlc calculates linear nlc-width and corresponding linear nlc-width expressions. On 2014's computers it works quite well up to graph sizes of about 10 nodes of linear nlc-width 3. The runtime depends on the size of the input graph, its linear nlc-width, and the number of nodes of high degree. The archive also contains the widths and corresponding expressions for the trees of up to 12 nodes. -
9
kpolynomeV2
A Qt program that calculates polynoms based on given data coordinates.
Qt 5.9 reimplementation of kpolynome - no KDE required. -
Free CRM Software With Something for EveryoneThink CRM software is just about contact management? Think again. HubSpot CRM has free tools for everyone on your team, and it’s 100% free. Here’s how our free CRM solution makes your job easier.
-
10
Novembre
STM data analysis
A tool for visualisation and analysis of STM and STS results. Currently supports RHK, WinSPM, Nanonis and Createc file formats. Other formats can be added. Tools are made available by plugins and are currently focused on spectroscopy manipulation. -
11
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF... -
12
SLAM++
high-performance nonlinear least squares solver for graph problems
SLAM++ is a minimalist implementation of incremental nonlinear least squares, containing lighting fast implementation of linear algebra on sparse block matrices. It is aimed for use in 3D reconstruction or robotics. -
13
ZeGrapher
Fast and easy to use plotting software.
ZeGrapher is a free and open source software for plotting mathematical objects (functions, sequences, parametric equations) and experimental data on the plane. This software is intended to be as easy to use as possible, suitable for high school students. -
14
Satsuma .NET Graph Library
a delicious .NET graph library
Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal... -
15
istiChartLib
C++ Chart Library for wxWidgets
IstiChartLib is one of the simplest c++ library for making chart or graph. It is developed using wxWidgets library. For windows, please use IstiChartLib.zip. For Linux (tested on Ubuntu) use IstiChartLib_Linux.tar.gz. For detailed documentation, please visit www.firagiel.com Password to extract: firagiel -
16
graphnet
AI project using a graph technique on written text.
Experiments using a data sequencing technique on English language sentences. -
17
mapgraph
Massively Parallel Graph processing on GPUs -- now part of Blazegraph
...://www.blazegraph.com/product/gpu-accelerated/. The early work was released under the Apache 2 open source license and is available on here at Sourceforge. This work was (partially) funded by the DARPA XDATA program under AFRL Contract #FA8750-13-C-0002 and DARPA Contract #D14PC00029. -
18
MolSig
The Stereo Signature Molecular Descriptor
An algorithm to compute molecular graph descriptors considering the stereochemistry of the molecular structure, based on our previously introduced signature molecular descriptor. The algorithm can generate two types of descriptors, one which is compliant with the Cahn-Ingold-Prelog priority rules, and a faster one based on our previous definition of a directed acyclic graph that isaugmented to a chiral molecular graph. -
19
ANGEL-Automatic differentiation Nested Graph Elimination Library is a template library using the Boost Graph Library and the Standard C++ Library; it provides sparse representations of c-graphs their dual line graphs and vertex, edge and face elimina
-
20
Web graph compression
web graph compression algorithms implementation
This project contains the implementation of web graph compression algorithms developed in Technical University of Łódź by Institute of Applied Computer Science. -
21
-
22
A simple application for extracting numerical data from published images which graphically represent data sets to which you do not have access.
-
23
RHOcker is a GTK graphic software tool for control and monitoring of electrical resistometry tests in GPIB devices. Allow to configure and manage resistometry test types and captures, stores and graph all data in tests execution.
-
24
A project to create of open source routing engine for navigation and possibly other graph analysis. Our goal is to build a commercial grade routing engine capable of find routes through 25-30 million node networks in 1 second ball park times.
-
25
This is a C++ library to create and simulate standard and hybrid bond graph. The library support XML input and output of the bond graph structure. Graphic representation of the bond graph in SVG are generated using the Graphviz library.