21 packages tagged with “directed”
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc...
QuickGraph .NET standard. QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc...
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net
Correct QuickGraph version for projects such as GraphX that use cross-platform PCL libraries. QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc...
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .NET Standard 2.0 QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc...
QuickGraph provides generic directed/undirected graph data structures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first search, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc...
In graph theory, a directed graph (or digraph) is a graph, or set of vertices connected by edges, where the edges have a direction associated with them. In formal terms, a directed graph is an ordered pair G = (V, E) with.
The DotNetDepends tool scans a folder containing assemblies and config file and generates a DGML file of the assembly dependencies.
imbSCI.Graph is an extension package for imbSCI library, extending graph classes with undirected graph object model and implementation for DGML, Dia, MXGraph (Draw.io) and DOT graph formats. Supports SVG rendering of charts (histograms, pie, bar and linear charts - in 2D and 3D.) and graph structures.
imbSCI.Graph is an extension package for imbSCI, extending graph classes with undirected graph object model and implementation for DGML, Dia, MXGraph (Draw.io) and DOT graph formats. Supports SVG rendering of charts (histograms, pie, bar and linear charts - in 2D and 3D.) and graph structures.
A .NET Standard library which provides classes for working with vertices, edges and graphs.
Package Description
dotnet tool ADepends
A light in-memory tool for managing dynamic computations in a directed acyclic graph, allowing automatic updates of node values based on input changes.
Lightweight Sugiyama (layered graph) layout engine for .NET. Zero external dependencies, allocation-aware, AOT-friendly.
A lightweight, open-source workflow contract layer built in C# on top of ML.NET principles. This package provides interfaces and data records only — no internal training recipes or infrastructure — making it safe to share while still giving developers powerful building blocks to orchestrate their own machine learning pipelines.
A library for all the data structures in C#. Every class is generic and reusable.