Search Results for "directed graph from csv"

...Define workflows where each step in the workflow is a container. Model multi-step workflows as a sequence of tasks or capture the dependencies between tasks using a directed acyclic graph (DAG). Easily run compute intensive jobs for machine learning or data processing in a fraction of the time using Argo Workflows on Kubernetes. Run CI/CD pipelines natively on Kubernetes without configuring complex software development products. Argo Workflows is the most popular workflow execution engine for Kubernetes. ...

Aleph-w is a library of data structures and algorithms implemented in and for C++. It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that...

Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31 vertices). ...

Cleanse is a dependency injection framework for Swift. It is designed from the ground-up with developer experience in mind. It takes inspiration from both Dagger and Guice. Cleanse is responsible for building a graph (or more specifically a directed acyclic graph) that represents all of your dependencies. This graph starts with a root object which is connected to its immediate dependencies, and those dependencies hold edges to its dependencies and so on until we have a complete picture of your application's object graph. ...

Fast, insightful and highly customizable Git history analysis. Hercules is an amazingly fast and highly customizable Git repository analysis engine written in Go. Batteries are included. Powered by go-git. There are two command-line tools: hercules and labours. The first is a program written in Go that takes a Git repository and executes a Directed Acyclic Graph (DAG) of analysis tasks over the full commit history. The second is a Python script that shows some predefined plots over the...

...Classes can be connected with all sorts of relations (Associations, Compositions, Generalization, etc.), objects with object relations. Following additional functionality is provided: Attributes, Mulitplicities, Roles, Object Graph Mode, Coloring, Save and Load, XMI 1.1 Import from Enterprise Architect, Associations (undirected, directed, bidirected), Aggregations, Compositions, Dependency, Generalization, Multiple Virtual Inheritance (Developer Addendum: It shouldn't be too difficult to add an API for remote application control, e.g. visualize and debug a running programm. ...

...Distribution of tasks occurs through a network of nodes that can accept tasks and execute them, or forward them on. 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.

AbuGraph is a freely available Java application for the layout and visualization of directed graphs. Bound to a TCP port, it supports dynamic graph creation receiving commands from a telnet console or another third party application.