Red Hat Ansible Automation Platform on Azure allows you to quickly deploy, automate, and manage resources securely and at scale.
Deploy Red Hat Ansible Automation Platform on Microsoft Azure for a strategic automation solution that allows you to orchestrate, govern and operationalize your Azure environment.
From desk booking and visitor management, to space planning and office utilization data, Eptura Workplace helps your entire organization work smarter.
With the world of work changed forever, it’s essential to manage your workplace and assets together to effectively create a high-performing environment. The Eptura experience combines the power of workplace management software with asset management, enabling you to effectively operate your building and facilitate hybrid work.
G.A.V. (GraphAlgorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
A threaded Web graph (Power law random graph) generator written in Python. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It implements a threaded variant of the RMAT algorithm.
JPowerGraph is a Java library for creating directed graphs for both Swing and SWT. It supports graph movement, selection, context menus, tooltips and dynamic edge creation. JPowerGraph has a spring layout algorithm based on that used in TouchGraph.
For Public, Charter, and Private Schools, Daycares, After-School Programs, and Summer Camps
PikMyKid is the first and only safe & smart dismissal solution for school districts, charter/private schools, after-school programs, YMCAs, JCCs, Summer camps, and daycare facilities. It connects schools, teachers, and parents through real-time tools to make dismissals safer and more efficient. PikMyKid schools are able to confidently organize their dismissals with ease and no longer rely on paper notes or tedious phone calls to the front office.
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
jGABL (the Java GraphAlgorithm Base Library) is a java library for the implementation of graph algorithms. It covers a hierarchy of graph concepts, various graph implementations, and algorithm animation.
The implementations of finding the k shortest paths (KSP) algorithm. A C/C++ library including some classical graph relative algorithm implementations.
A state-of-the-art cloud-based classroom management solution that provides educators with the tools to facilitate efficient collaborative distance learning in or outside the classroom. Share your screen, video camera and whiteboard in lecturer mode or group collaboration, remotely monitor and assist students in real-time. Streamline the learning experience and keep your finger on the classroom pulse.
Stand-alone version of OrthoMCL is programmed in PERL, runs in UNIX-like systems. It uses the Markov Clustering Algorithm (MCL) to perform a graph clustering of protein orthologs from multiple eukaryotic genomes.
A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)
- A Simple Solution For Graph Drawing
- Fast 2d Rendering (Span-Buffer Algorithm)
- Support Essential Basic Shapes (Box, Rounded Box, Circle)
- Support Curve Line
- Shadow Glow