Kemsekov.GraphSharp.GoogleOrTools 3.1.3

.NET 6.0 This package targets .NET 6.0. The package is compatible with this framework or higher. 
dotnet add package Kemsekov.GraphSharp.GoogleOrTools --version 3.1.3                

                    
                

            
NuGet\Install-Package Kemsekov.GraphSharp.GoogleOrTools -Version 3.1.3
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.GoogleOrTools" Version="3.1.3" />
For projects that support PackageReference, copy this XML node into the project file to reference the package. 
paket add Kemsekov.GraphSharp.GoogleOrTools --version 3.1.3                

                    
                

            
#r "nuget: Kemsekov.GraphSharp.GoogleOrTools, 3.1.3"
#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.GoogleOrTools as a Cake Addin
#addin nuget:?package=Kemsekov.GraphSharp.GoogleOrTools&version=3.1.3

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

GraphSharp

nuget

LP solvers for GraphSharp

nuget

GraphSharp

GraphSharp is a tool to manipulate on the set of connected nodes, or just graph.

It is currently the most advanced graph library in c#.

Also, this library have adapters for graphs from another library QuikGraph.

And also for Satsuma

So any algorithms that works in these libraries also work here + this library contains lots and lots more algorithms and operations.

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

Various path finders 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

Hamiltonian cycle finder (using google or tools) output

Pagerank using QuikGraph example

Max flow algorithm using google or tools example

Min cost flow using google or tools example

Different graph center finders example

This example condenses cliques of original graph into nodes of new graph

Clique condensation graph condensedCliques

This example condenses strongly connected components of original graph into nodes of new graph

SCC condensation graph condensedSCC

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

This package is not used by any NuGet packages.

GitHub repositories

This package is not used by any popular GitHub repositories.

Version Downloads Last updated
3.1.3 287 2/14/2024
3.1.2 120 2/6/2024
3.1.1 118 1/26/2024
3.1.0 108 1/25/2024