Search Results for "graphs" - Page 2
Sort By:
Showing 91 open source projects for "graphs"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Our Free Plans just got better! | Auth0You 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 security. Auth0 now, thank yourself later.
-
1
HRDAG
Framework for Hierarchical Graph Decomposition
This is a framework used to decompose hierarchical graphs, i.e.,graphs which were created from or contain a hierarchy of modules. Each module is reused several times in the hierarchy. This may be useful to reverse-engineer human constructs like electronic equipment, manufactured machines, or bureaucratic hierarchies; but also to decompose natural constructs like gene-relation or protein-relation nets. -
2
SvnStat
Subversion (SVN) Statistics
SvnStat (Subversion Statistics) generates statistical reports with graphs and charts similar to StatCvs from Subversion (svn) logs. -
3
UnitTH - Unit Test History Matrix
Jenkins plugin / tool for generating test history reports
...Using the stand alone tool a set of HTML test history pages will be generated from JUnit test results. The test history displays various different sortable test statistics, trends, graphs and references to the included JUnit test reports. -
4
JCycles
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later. -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
GraphEditor
Graph editing tool
For creating graphs with can be exported to use in game making environments. -
6
JRobin is a 100% pure Java alternative to RRDTool, with about exactly the same specifications. If you provide the same data to RRDTool and JRobin, you will get exactly the same results and graphs. All standard RRDTool operations are supported.
-
7
DomainHealth is an open source "zero-config" monitoring tool for WebLogic. It collects important server metrics over time, archives these into CSV files and provides a simple web interface for viewing graphs of current and historical statistics.
-
8
SPARGEL
An opensource Java graph library. Abandoned, ignore.
Spargel is a Java graph library that puts its effort in having a rather small but powerful code basis. This is achieved by extending graphs via properties in form of vertice and edge maps. Because these maps are an individual implementation depending on the graph datastructure used, they are more memory efficient than using a Java HashMap. Currently spargel is in its early stages, but will soon support more tasks. As now, implemented are: * Adjecency graph data structures * Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components * Creating sub graphs, vertice and edge maps that use a function to implement their mapping. ... -
9
-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
10
Hattori is a Java DTO Population Framework for Web Applications. Simplifies the syncronization between Data Transfer Object graphs and Domain Object graphs.
-
11
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). 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). ... -
12
Needle
Effective Unit Testing for Java EE
Needle is a lightweight framework for testing Java EE components outside of the container in isolation. It reduces the test setup code by analysing dependencies and automatic injection of mock objects. It will thus maximize the speed of development as well as the execution of unit tests. Follow us on Twitter (@NeedleProject) -
13
-
14
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. ... -
15
RELATED - REmotes LAboraTories extenED
Java Framework for developing of remote/virtual laboratories
RELATED framework proposes a structured methodology of remote/virtual labs development and, also, provides common facilities as user management, booking, basic visualization (trend graphs and direct interaction using interactives variables), data logging and experimental session’s control. In order to get these facilities, an RLAB (Remote LABoratory) system it defined using a formal specification of a virtual or remote laboratory (based on XML and used to structure components for laboratory). The main component is experiment, so students could run these experiments using RELATED facilities as painting data from the laboratory, change any relevant variable or take a look on laboratory structure. ... -
16
CHAP Links Library is a web based visualization library for displaying graphs, networks, and timelines. The tools are developed as Google Visualization Charts for Javascript and GWT. Links Library is part of CHAP, the Common Hybrid Agent Platform. This project has been moved to Github. Please visit http://almende.github.com/chap-links-library/
-
17
A plugin for the Eclipse IDE to generate control flow graphs and show coverage information. Supports node, edge, edge-pair and prime path coverage. Based on the Eclipse Control Flow Graph Generator (http://eclipsefcg.sourceforge.net/)
-
18
CP2JavaWS is a Cappuccino to Java remote services bridge with a transparent syntax, complex objects graphs management, digest and ldap authentication, authorization, live remote data browsing and master/detail views creation by a single line of code. UPDATE : the new Direct2CP project adds support for php, fixes and enhancements, new components.
-
19
jLlama is a desktop application to monitor servers over SSH. Any figure retrieved from the command line can be polled and graphed in real time. Out of the box, jLlama can graph CPU and Memory usage for Linux and Solaris servers.
-
20
The Flexible Task Graphs programming model and supporting system for Java provides tools for very low latency real time programming in Java.
-
21
Project consists in a software that reads a copied web site to your computer and generates a graph model of it. The model is based on the links, which are seen as the edges, and the pages, which are the vertices of the graph.
-
22
A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org
-
23
JmxHist keeps monitoring history of your application's state, via JMX, and stores in a csv file. You can specify MBeans/Attributes to be stored. You can take certain action when an attribute meet a threshold. It shows charts of the data via web.
-
24
NG4J - 'Named Graphs API for Jena' is an extension to the Jena Semantic Web framework for parsing, manipulating and serializing sets of Named Graphs. For details about Named Graphs see http://www.w3.org/2004/03/trix/
-
25
Mantikhor is an *information representation* language. Like RDF, it models information as directed-edge arc-node graphs, although Mantikhor's use of such constructs is more structured and constrained.
