Search Results for "graph" - Page 13
Sort By:
Showing 492 open source projects for "graph"
View related business solutions-
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
1
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. -
2
QCacheGrind (KCacheGrind) Windows build
Windows prebuilt binary of QCacheGrind (better known as KCacheGrind)
...Please go to https://sourceforge.net/projects/kcachegrind for the source. Description from the main project: 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. -
3
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.
-
4
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.
-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
5
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
...We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. ... -
6
XDX Charts free
XDX Charts
XDX Charts is a DevExpress components extension regarding creation of diagrams. The provided component will allow you to quickly and conveniently add the charts to your application and connect them to your data sources. This product represents a visual component and an operation component with data sources. -
7
-
8
Diffusive
Task-oriented distributed computing framework
...Nodes executing a task, load the required resources as needed, and cache them. The topology of the network of nodes can be anything that can be represented as a directed graph. Topologies can be tailored to solve specific problems. Diffusive is a Java refer- ence implementation of the six principles that define diffusive programming. -
9
Java Fast Method Call Graph Generator
Analysis tool that generates method call graphs
The project's aim is to develop a fast Method Call Graph generator for the Java Programming Language. The search proceedure combines a Finite State Machine and ad hoc parsing to allow for fast access to method definitions and method calls within the source code. -
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
python dagger
File dependency graph evaluator in pure python.
Dagger evaluates file dependencies in a directed-acyclic-graph (DAG) like GNU make, but timestamps or hashes can be used on a per-file basis when evaluating which file nodes are up to date or stale. Use fast timestamp comparisons on large files when hashing is too slow, and hashing on small files. When hashing is used, it's stored in either a text file or sqlite database (in-memory at runtime is optional). -
11
The Firm library implements the Firm intermediate representation (ir), a graph based SSA intermediate represenation for compilers.
-
12
flow is a cross-platform headers-only C++11 framework which provides the building blocks for streaming data packets through a graph of data-transforming nodes
-
13
PacmanTree
Program for generating Arch Linux Pacman Manager dependencies graph
Program to help using Arch Linux Pacman package manager. Program using pydot (python interface for Graphviz http://code.google.com/p/pydot/) to generate graph of dependencies for package selected by user. -
14
Graph Database
A robust, reliable, user-friendly, and high-performance Graph Database
This is an academic project to build a graph database, supporting multiple users, with fully functioned data query, data manipulation and indexing mechanism. It is running in a distributed client-server mode. This project is assigned to final-year project from group IT121B, Bachelor of Computing, University of Wollongong. -
15
RDF P
RDF Eclipse Plugins
...RDF P is based on OpenRDF/Sesame and bundles OWLIM Lite. Currently follwing features are included: * Turtle editor with syntax highlighting * Outline page displaying the RDF contents as table * Graph view displaying RDF as interactive graph * Builder to assemble RDF files into a local repository * SPARQL editor which access the local repository * New Turtle file wizard You can download Tawny which is an Eclipse IDE edition demonstrating RDF P. -
16
Asteroid
A CBLS Engine in SCALA, NOW part of OscaR
Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms. -
17
Semi-automated exploration of all page links inside a web application. Produces a map (i.e. a graph) of all links between pages, including relationships on HTTP request parameters and form input fields.
-
18
-
19
FunctionCheck is a profiler for C/C++ programs, based on gcc V4.6.3+. Features are flat profile, cycles detection, call-graph, MIN/MAX time in functions, memory profiling, profiling control at execution...
-
20
KDD: Kernel Data Disambiguation Tool
KDD: Kernel Data Disambiguation Tool
...KDD disambiguates the pointer-based relations including generic pointers - to infer their candidate types/values - by performing static points-to analysis on the kernel’s source code. KDD takes the source code of an OS kernel as input and outputs an accurate directed type-graph that represents the kernel data definition. KDD is able to scale to the enormous size of kernel code, unlike many other points-to analysis tools. -
21
QFlow is a dataflow framework written in Qt which allows interaction of QObjects in a dataflow graphs. Such a workflow can contain graphical modules(QWidgets) which would be displayed during the execution of graph and can interact with other QObjects. Framework consists of Designer and multiple plugins with modules.
-
22
Noise Graph
LibNoise module graph designer
Noise Graph allows you to graphically design libNoise modules, preview data as raw numbers or as image, and when you are satisfied with results generate C++ class ready to use in your application. -
23
NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
-
24
-
25
gwt-html5-graph
GWT Diagram Library Components based on html5/eclipse gef/eclipse emf
...Based on gwt-html5-graph, the user may transplant very conveniently the eclipse platform development each kind of graph/modelling application to WEB on, also may develops the new WEB vector graph application based on formidable eclipse platform GEF API and EMF/UML2 API, like each kind of flow chart, engineering plat, UML modelling, GIS and so on. Demo1(GEF Sample): http://euml.trufun.net/drawx/gef-sample/Gef_sample.html
