SharpGraph 1.3.1

SharpGraph

A C# graph library with support for both directed- and undirected graphs (simpel- and multigraphs).

Features

1. Serializable to json and deserializable from json.
2. Graph properties:
   • Vertices
   • Edges (arrows and lines)
   • Sources
   • Sinks
   • IsAcyclic
   • HasCycles
   • Density
   • IsSparse
   • IsDense
   • IsDirected
   • IsDirectedAcyclic
3. Graph methods:
   • AddVertex (given a vertex)
   • AddEdge (given a edge)
   • AdjacentVertices (given a vertex)
   • AdjacentEdges (given a vertex)
   • AllPaths (between two given vertices)
4. Multiple graph representations available.
   • AdjacencyList
   • AdjacencyMatrix

Nuget

Install-Package SharpGraph

How to use

Step 1

Create a vertex class by extending the Vertex base class.

public class TestVertex : Vertex
{
    public TestVertex(string identifier)
        : base(identifier)
    {
    }
}

Step 2

Create a edge class by extending either the Line class (undirected edge) or the Arrow class (directed edge).

public class TestArrow : Arrow<TestVertex>
{
    public TestArrow(TestVertex source, TestVertex target)
        : base(source, target)
    {
    }
}

Step 3

Create a new instance of the Graph class with your own vertex and edge classes as generic types. You can use a fluent syntax for adding vertices and edges.

var vertex1 = new TestVertex("A");
var vertex2 = new TestVertex("B");
var vertex3 = new TestVertex("C");
var vertex4 = new TestVertex("D");
var graph = new Graph<TestVertex, TestArrow>()
    .AddVertex(vertex1)
    .AddVertex(vertex2)
    .AddVertex(vertex3)
    .AddVertex(vertex4)
    .AddEdge(new TestArrow(vertex1, vertex2))
    .AddEdge(new TestArrow(vertex1, vertex3))
    .AddEdge(new TestArrow(vertex2, vertex4))
    .AddEdge(new TestArrow(vertex3, vertex4));
var pathsVertex1ToVertex4 = graph.AllPaths(vertex1, vertex4);

foreach (var path in pathsVertex1ToVertex4)
{
    Console.WriteLine(string.Join(", ", path.Select(i => $"{i.Source}->{i.Target}")));
}

This gives the following result on the console.

A->B, B->D
A->C, C->D