Search Results for "graph c#"
Sort By:
Showing 133 open source projects for "graph c#"
View related business solutions-
HubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
-
Over two-thirds of people reuse passwords across sites, resulting in an increasingly insecure e-commerce ecosystem. Learn how passwordless can not only mitigate these issues but make the authentication experience delightful. Implement Auth0 in any application in just five minutes
-
1
RootGraph
Graphic interface with algorithms to compute line and root graphs
Simple and intuitive graphic interface for graph theory with algorithms to compute line and root graphs of a given graph. - Double click to add a new node. - Left click a node and drag to change the position of the node. - Select a node with left click and add an edge with the next node you select. - Right click a node to delete it. Made in C++ using the wxWidgets library. -
2
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. -
3
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... -
4
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. -
Discover and manage administrator, service, and web app passwords, keys, and identities. Automate management with approval workflows. Centrally control, audit, monitor, and record all access to critical IT assets.
-
5
Graph Plotter
GP is a tool to analyse numerical data
GP is aimed to be simple and fast tool to analyse numerical data. It does not claim to replace all other plotters. -
6
This is a method for identifying graphs using MD5 hashing. It can be used for graph equality comparisons and to facilitate graph isomorphism testing. The graphs can be labeled or unlabeled.
-
7
Graph is a program used for drawing graphs of mathematical functions. It is easy to use while having a lot of features and settings. Official web site is located at http://www.padowan.dk
-
8
A2L Build for MCD - AutoExtractGui
Build A2L from ELF for Automotive MCD tool (e.g. INCA)
... with the given sample files (sample AEC, ELF, A2L). 2. ProF Builder This tool is to help people who need to make their own ProF script to FLASH their controllers through INCA. You can utilize "template" of XCP or UDS when you need to make a new ProF script. 3. INCA Instrument SDK Sample Project As a sample, I upload an Instrument project - displaying bar graph. 4. A2L Hint Help you easily read/browse A2L file, also give you some hints. -
9
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) -
Venn is a secure workspace for remote work that isolates and protects work from any personal use on the same computer. Work lives in a secure local enclave that is company controlled, where all data is encrypted and access is managed. Within the enclave – visually indicated by the Blue Border around these applications – business activity is walled off from anything that happens on the personal side. As a result, work and personal uses can now safely coexist on the same computer.
-
10
Advanced Trigonometry Calculator
Precision Trigonometry: Advanced Calculator for Complex Math
Advanced Trigonometry Calculator is equipped with a user-friendly interface that allows for easy input of problems and instant computation. Professionals such as engineers who need to perform advanced trigonometric calculations in their work will find this tool extremely useful. More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by the Portuguese Renato Alexandre dos Santos Freitas. Also author of poems,... -
11
zshg
constant-time graph connectivity test
zshg is an implementation of a constant-time connectivity test for graphs. It is based on "Property Testing in Bounded Degree Graphs" by Oded Goldreich and Dana Ron, "Algorithmic and Analysis Techniques in Property Testing" by Dana Ron. -
12
calculatorpp
Calculator++
Written in C++ (using template). Calculator++ is a application/library for Window (POSIX). The core of code is adaptable for posix. This algorithm support: + built-in operator + built-in functions + run-time functions and variables definition + run-time units system, units with prefix + constants definition + Pretty mathematical expressions - Process ascii files (dev) - vector and matrix (dev) - graph 2D and 3D (dev) - vector graph (dev) - symbolic... -
13
Glove
Data analysis tool
Glove provides an interface to data acquisition systems, sophisticated (and correct) statistical analysis, a plotting tool, and the ability to easily manipulate the data. Its modular design allows plug-ins for acquisition, manipulation, and analysis. ChangeLog: http://glove.sourceforge.net/ChangeLog.html -
14
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.
-
15
GenReg
Generation of regular graphs
Efficient, complete and non-redundant generation of regular graphs as described in M. Meringer: Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory 30, 137-146, 1999. -
16
gml4gtk
small console GML or graphviz DOT graph viewer
directed graph layout program for GML (Graph-Markup-Language) graph or partial graphviz DOT graph -
17
Modal Plotter
Create Strain and Kinetic Energy Density maps from FEA
Create Strain and Kinetic Energy Density maps out of a Natural Frequency extraction analysis (i.e. modal analysis). Works with a variety of FEA results format: NASTRAN, ABAQUS, Ansys, Medina/Permas. -
18
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. -
19
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. -
20
Pigale is a graph editor and a C++ algorithm library essentially concerned with planar graphs. This software, particularly intended for graph theoretical research, includes new algorithms based on our recent theoretical researches.
-
21
slgraph
a graph format and library for sublinear graph algorithms
slgraph consists of graph formats suitable for sublinear-time graph algorithms and libraries for reading and writing these formats. -
22
kpolynomeV2
A Qt program that calculates polynoms based on given data coordinates.
Qt 5.9 reimplementation of kpolynome - no KDE required. -
23
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. -
24
Meraculous-2D
Eukaryotic Genome Assembler
---------------------------------------- IMPORTANT: Meraculous-2D has been superseded by the HipMer assembler, available here: https://sourceforge.net/projects/hipmer/ ----------------------------------------- Meraculous-2D is a whole genome assembler for NGS reads (Illumina) that is capable of assembling large, diploid genomes with modest computational requirements. Features include: - Efficient k-mer counting and deBruijn graph traversal - Two modes of handling of diploid allelic... -
25
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...