KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#typescript #ai-agents #cli #claude-code #codex #developer-tools #dsh-plugin #deepseek-harness #windows #open-source #agent-skills #ai

GraphSharp

★ 89 Open GitHub ↗

GraphSharp is a tool to study and use knowledge of graph theory in C#!

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

GraphSharp

[![nuget](https://img.shields.io/nuget/v/Kemsekov.GraphSharp.svg)](https://www.nuget.org/packages/Kemsekov.GraphSharp/)

LP solvers for GraphSharp

[![nuget](https://img.shields.io/nuget/v/Kemsekov.GraphSharp.svg)](https://www.nuget.org/packages/Kemsekov.GraphSharp.GoogleOrTools)

# 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](https://github.com/KeRNeLith/QuikGraph).

And also for [Satsuma](https://github.com/unchase/Unchase.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](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/FindPathByMeetInTheMiddle)
![example](https://github.com/Kemsekov/GraphSharp/assets/57869319/e54d8439-e14e-4560-a89d-80d1e19e00e7)

[Graph coloring (Greedy, DSatur, RLF, Coloring from QuikGraph)](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/GraphColoring)
![example](https://github.com/Kemsekov/GraphSharp/assets/57869319/e0f6ffc0-ca7b-4b57-9ff9-748a6efd2fd4)

[Delaunay triangulation](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/DelaunayTriangulation)
![example](https://user-images.githubusercontent.com/57869319/174455462-f0a7b769-33b8-47b9-b6a6-2936c02f4cbb.jpg)

[Minimal spanning tree](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/Tree)
![example](https://github.com/Kemsekov/GraphSharp/assets/57869319/b136945c-a163-4a9d-9bb2-07358a4bc1c7)

[Topological sort](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/TopologicalSort)
![example](https://user-images.githubusercontent.com/57869319/174638380-b39624b7-8c99-4544-a69b-f99f589d72b4.jpg)

[Find articulation points](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/ArticulationPointsFinder)
![example](https://user-images.githubusercontent.com/57869319/176494620-2cb92342-aa2d-432f-bfc6-ca503017464d.jpg)

[Find components of a graph](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/FindComponents)
![example](https://user-images.githubusercontent.com/57869319/176998046-e1ba18c7-9f11-4b9d-bd2f-54537d5d4a0a.jpg)

[Cycles basis finder](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/CycleFinder) (here I color 10 shortest cycles found)
![example](https://user-images.githubusercontent.com/57869319/179674538-142bf36b-e760-49d8-9ed6-eed3c512e907.jpg)

[Strongly connected components finder](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/StronglyComponentsFinder)
![example](https://user-images.githubusercontent.com/57869319/181353679-86969151-e88e-4600-8db1-8d9e361e96ce.jpg)

[TravelingSalesmanProblem](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/TravelingSalesmanProblem)
![example](https://user-images.githubusercontent.com/57869319/183226714-827188f0-2f34-4a99-b90d-c6937c5dd41f.jpg)

[Hamiltonian cycle finder (using google or tools)](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/HamiltonianCycle)
![output](https://github.com/Kemsekov/GraphSharp/assets/57869319/cb861151-1a75-461a-a4ed-33b0e582fc93)

[Pagerank using QuikGraph](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/PageRank)
![example](https://user-images.githubusercontent.com/57869319/187511214-3963fa78-ebf5-4d84-8bac-b483ea70f4b1.jpg)

[Max flow algorithm using google or tools](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/MaxFlow)
![example](https://github.com/Kemsekov/GraphSharp/assets/57869319/2f4a37eb-57e4-4ff2-9665-6753c25cb73d)

[Min cost flow using google or tools](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/MinCostFlow)
![example](https://github.com/Kemsekov/GraphSharp/assets/57869319/ce098798-476e-4645-857d-92d3a6aba5da)

[Different graph center finders](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/CenterFinder)
![example](https://github.com/Kemsekov/GraphSharp/assets/57869319/3f806a34-18a9-46bb-ad18-040e96644cad)

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

[Clique condensation](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/CondenseCliques)
![graph](https://github.com/Kemsekov/GraphSharp/assets/57869319/068f4855-d432-404c-b20e-a3835499ca38)
![condensedCliques](https://github.com/Kemsekov/GraphSharp/assets/57869319/7a8c69f3-e25d-4a9f-9ac6-1f60f902b1c9)

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

[SCC condensation](https://github.com/Kemsekov/GraphSharp.Samples/tree/main/samples/CondenseSCC)
![graph](https://github.com/Kemsekov/GraphSharp/assets/57869319/6cf1aaff-e776-48e0-8300-c3f50888535b)
![condensedSCC](https://github.com/Kemsekov/GraphSharp/assets/57869319/ab553e2c-9149-4dd4-a27c-5d30ffcb5a16)

GraphSharp

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README