Kemsekov.GraphSharp 3.0.1

.NET 6.0 This package targets .NET 6.0. The package is compatible with this framework or higher.
There is a newer version of this package available.
See the version list below for details. 
dotnet add package Kemsekov.GraphSharp --version 3.0.1                

                    
                

            
NuGet\Install-Package Kemsekov.GraphSharp -Version 3.0.1
This command is intended to be used within the Package Manager Console in Visual Studio, as it uses the NuGet module's version of Install-Package. 
<PackageReference Include="Kemsekov.GraphSharp" Version="3.0.1" />
For projects that support PackageReference, copy this XML node into the project file to reference the package. 
paket add Kemsekov.GraphSharp --version 3.0.1                

                    
                

            
#r "nuget: Kemsekov.GraphSharp, 3.0.1"
#r directive can be used in F# Interactive and Polyglot Notebooks. Copy this into the interactive tool or source code of the script to reference the package. 
// Install Kemsekov.GraphSharp as a Cake Addin
#addin nuget:?package=Kemsekov.GraphSharp&version=3.0.1

// Install Kemsekov.GraphSharp as a Cake Tool
#tool nuget:?package=Kemsekov.GraphSharp&version=3.0.1

nuget

GraphSharp

GraphSharp is a tool to manipulate on the set of connected nodes, or just graph. It allow you to create such algorithms as dijkstra algorithm(shortest path finder), graph coloring, components finder etc... Also, this library have adapter for graph structure to works as one from QuikGraph. So I could call this lib like an extension for QuikGraph library at this point.

For samples see https://github.com/Kemsekov/GraphSharp.Samples

Dijkstra algorithm example Graph coloring (Greedy, DSatur, RLF, Coloring from QuikGraph) example Delaunay triangulation example Minimal spanning tree example Topological sort example Find articulation points example Find components of a graph example Cycles basis finder (here I color 10 shortest cycles found) example Strongly connected components finder example TravelingSalesmanProblem example I have a adapter for IGraph to work as graph from QuikGraph. Here is an example how this works using PageRank implementation from QuikGraph. example Max flow algorithm from left bottom to top right (here max capacity is edge length). The brighter - the more flow goes trough example

Product Compatible and additional computed target framework versions.
.NET net6.0 is compatible.  net6.0-android was computed.  net6.0-ios was computed.  net6.0-maccatalyst was computed.  net6.0-macos was computed.  net6.0-tvos was computed.  net6.0-windows was computed.  net7.0 was computed.  net7.0-android was computed.  net7.0-ios was computed.  net7.0-maccatalyst was computed.  net7.0-macos was computed.  net7.0-tvos was computed.  net7.0-windows was computed.  net8.0 was computed.  net8.0-android was computed.  net8.0-browser was computed.  net8.0-ios was computed.  net8.0-maccatalyst was computed.  net8.0-macos was computed.  net8.0-tvos was computed.  net8.0-windows was computed. 
Compatible target framework(s)
Included target framework(s) (in package)
Learn more about Target Frameworks and .NET Standard.

NuGet packages (1)

Showing the top 1 NuGet packages that depend on Kemsekov.GraphSharp:

Package Downloads
Kemsekov.GraphSharp.GoogleOrTools

Package Description

GitHub repositories

This package is not used by any popular GitHub repositories.