Search Results for "graph c#" - Page 9
Sort By:
Showing 492 open source projects for "graph c#"
View related business solutions-
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
-
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.
-
1
FASCIA: Parallel Subgraph Counting
Parallel graph analysis package
Fast Parallel Subgraph Counting using Color-coding. -
2
Scheme
Basic plotting tools for Qt
Basic plotting tools for Qt Scheme is mean to be simple. Most setting have default value, to draw a graph the only things you need to do is : - put your data inside a stl vector - send it to the Graph Object for drawing -
3
Graphlet kernel framework
Calculates similarity between neighborhoods of two vertices in a graph
This software package provides a framework for calculating similarity between neighborhoods rooted at two vertices of interest in a labeled graph (undirected or directed). The list of available similarity functions includes: cumulative random walk, standard random walk, standard graphlet kernel, edit distance graphlet kernel, label substitution graphlet kernel and edge indel graphlet kernel. The graphlet kernel framework can be used for vertex (node) classification in graphs, kernel-based... -
4
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
-
Drive your organization forward with the right solution at the right price. AI-powered continuous accounting and ERP to support your growth now and into the future.
-
5
TSPLib.Net
TSPLib wrapper for .Net
TSPLib is a set of Traveler Salesman and related graph problems gathered by the Heidelberg university. This project provides .Net library wrapping up library files loading code, implements distance functions and all the TSPLib features. If you'd like to test your graph tour searching algorithm on a TSP lib will save you hours of reading in a data and adjusting your code to ensure that result are comparable. Delivering as a dll with .Net wrapper and a zip archive with all the original data... -
6
ThunderstormDistributor
Distribute jobs to compute nodes on dynamic clusters
ThunderstormDistributor is a queuing system that distributes jobs and computational workload across dynamic clusters in the cloud. It manages the assignment of jobs to maximize CPU and memory usage and prevent oversubscription of compute nodes. It also performs advanced statistics collection on individual compute nodes and jobs to graph the distribution of disk, network, CPU, and memory usage over time, which facilitates the advanced optimization and tuning of computational workflows. -
7
Iterative Flow Analysis
Iterative Data and Control Flow Analysis
https://github.com/jplevyak/ifa IFA, Iterative Flow Analysis is a combined data-flow and control flow analysis. It is capable of resolving the concrete types (as opposed to the nominal or declared types) and the interprocedural call graph for statically or dynamically typed programs. -
8
Jlint
Static analyzer for Java bytecode
Jlint will check your Java code and find bugs, inconsistencies and synchronization problems by doing data flow analysis on the code and building the lock graph. Jlint is fast, easy to learn, and requires no changes in the class files to be checked. -
9
With workstation powers, HTML5/CSS3 maturity support of XML, SVG, SGML, Canvas and finally the power of JScript frameworks some new Office alternatives can be built with full compliance between Win/Mac/Linux/UNIX, ... and share data representations over networks. I start a new large international project to build an OpenSource (European Union Public Licence - EUPL). This project will include: A. A-Office-Data B. A-Office-Matrix C. A-Office-Graph D. A-Office-Slide E. A-Office-Word F...
-
Save time, money and your sanity. Deluxe Payment Exchange+ (DPX+) is our integrated payments solution that streamlines and automates your accounts payable (AP) disbursements. DPX+ ensures secure payments and offers suppliers alternate ways to receive funds, including mailed checks, ACH, virtual credit cards, debit cards, or eCheck payments. By simply integrating with your existing accounting software like QuickBooks®, you’ll implement efficient payment solutions for AP with ease—without costly development fees or untimely delays.
-
10
Soothsayer
Capacity exhaustion prediction from RRD files
Predict if storage utilised will reach capacity within defined period (maximum 5 years), using recent historical data contained within RRD files (maximum -1 year). Produces HTML (or partial HTML) and, more importanly, a PNG RRD Graph showing the prediction and, should the capacity be reached, an annotation indicating when. Optionally email out exception notices. -
11
arcadegl
2D - 3D game engine
Arcade is a lightweight,self contained 2D/3D game engine written in C++. Arcade uses OpenGL for graphics and DirectX for sound,music and user input. Implemented features: 2D Primitives (lines,circles,ellipses,rectangles...) Full screen/windowed mode toggle during program execution V-SYNC and double buffer smooth fading Sprites,sprites animations,sprite rotations and linking Image loading (actually only TGA,PCX,BMP are supported) Fast raster operations on images 3D (not completed yet) Scen... -
12
S-BITE
S-BITE is an AS level topology generator for the Internet
... graph metrics, and represent its structure. S-BITE is mostly implemented in C and depends on the igraph library available at http://igraph.sourceforge.net In order to speed up the execution of the different components, the package uses shell scripts. -
13
LGL is a compendium of applications for making the visualization of large networks and trees tractable. LGL was specifically motivated by the need to make the visualization and exploration of large biological networks more accessible.
-
14
BGP Looking-glass
Open Source BGP Looking-glass
BigPlg allows the collection of the IPv4 Internet routing table which may be viewed by service providers and/or ISP customers to validate IP routing across autonomous systems. Routing updates may also have attributes aliased to become (graph) readable. This function exists to allow the exporting of RIB updates to Splunk, or any such data collector. A beneficial side-effect of collecting BGP routing information is the ability to track BGP updates/events local or remote(upstream). To analyze... -
15
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. -
16
File Transfer
Transfers files/folders P2P over LAN or Internet
Client-server transfers files/folders P2P, fast and secure: transparent compression/encryption (SSL), pause/resume, TCP/UDP connection, auto-discover, proxy support (HTTP, SOCKS5), NAT Traversal (Teredo, UPnP), HTTP/FTP downloads, speed graph, chat. -
17
X-Graph
An application that graphs and differentiates functions.
A C#.Net desktop application that accepts a standard function as input, then graphs and differentiates the given function. Extra info about the function will also be given, including extrema, domain/range, etc. As of now, this application is able to graph and differentiate any standard binomial function. Enjoy! Checkout: http://hifuture.org/products-open-source-projects/ for more open source applications! -
18
Autonom
Enter a two dimensional maze and exit automatically.
... to find its way until it reaches the (0,x) point. In version 1.0.0, we have limitations; - We're in 2 dimensional world, meaning we have only x and y axis. - We have a one-way graph. There's only one solution to find the way from the starting point to the (0,x) point. Future versions will include 3 dimensional space and will include more complex mazes with many solutions. Arda Ulas UNLU ardaulas@hotmail.com -
19
* Model-checking/simulation-checking library for real-time system with dense-time models in C with CRD (Clock-Restriction Diagrams) technology. * Parametric analysis library for linear-hybrid systems in C with HRD (Hybrid-Restriction Diagram) technol
-
20
gc_hole_filling
Depth map hole filling using graph cuts
Code to fill missing holes in a depth map using a second-order smoothness prior. Implemented in matlab using graph cuts. Accompanies the paper "Herrera C., D., Kannala, J., Ladicky, L., Heikkila, J., Depth map inpainting under a second-order smoothness prior, SCIA, 2013" -
21
The Network-Integrated Multimedia Middleware (NMM) is a flow graph based multimedia framework that allows to create distributed multimedia applications: local and remote multimedia devices or software components can be combined.
-
22
Fltk_contour
2D and 3D contour and colour map of regular or scattered data
NOTE: This project was moved to: https://github.com/eetorres An easy scientific data visualization widget for the FLTK library. The widget is an OpenGL based contour visualizer for Linux, which allow you to built 2D and 3D graph of contour and colour map for a xy regular or scattered data set. There is a good example with the topographic data of Poland with 5902 data points to introduce yourself how to use it. There is not much documentation but it is easy to use. The input data are in XYZ... -
23
CoFlo
C and C++ control flow graph generator and analyzer
CoFlo generates Control-Flow Graphs from C and C++ source code. It can then output the graphs in a number of ways and perform various control flow analyses. NOTE: CoFlo has not been under active development for several years. At this time, I suggest you look into LLVM-based tooling to see if there is anything similar to CoFlo which will meet your needs. -
24
KCachegrind visualizes traces generated by profiling, including a tree map and a call graph visualization of the calls happening. It's designed to be fast for very large programs like KDE applications.
-
25
KDT provides domain experts with a simple interface to analyze very large graphs quickly and effectively without requiring knowledge of the underlying graph representation or algorithms. It provides a Python interface and can run on clusters.