@@ -7,13 +7,16 @@ This project is a simple implement a mathematical graph library that provides st
7
7
- generic data in node and edge
8
8
- supports weighted graph
9
9
- supports directed graph
10
+ - minimal spanning tree Kruskal and Prim algorithm (for weighted graph)
10
11
- shortest Dijkstra path algorithm (for weighted graph)
11
- - save graph system
12
+ - node coloring
13
+ - traversal
14
+ - save graph system (save to file).
12
15
- graph to serializable graph and conversely converter (easy to save)!
13
16
14
17
## Setup
15
18
Compiling bin library is located in /bin folder. <br />
16
- Copy Graph and Priority Queue (.dll files) to your project. <br />
19
+ Copy Graph and Priority Queue (.dll files) to your project (and GraphSave when you save graph to file). <br />
17
20
NuGet package available soon.
18
21
19
22
## Simple code example
@@ -42,8 +45,9 @@ Console.WriteLine(edge01.Data); /* or */ Console.WriteLine(graph[0, 1].Data);
42
45
graph .RemoveEdge (node0 , graph [1 ]); // remove edge beetwen node 0 and 1
43
46
graph .RemoveNode (graph [0 ]); /* or */ graph .RemoveNode (node0 ); // node 1 becomes to node 0
44
47
```
45
- For more information, you must view [ documentation] ( https://github.com/Guzik1/.Net_MathGraph/blob/master/docs/Graph/index.md ) . <br />
46
- Examples available here (TODO! make examples).
48
+ For more information, you must view [ Graph documentation] ( https://github.com/Guzik1/MathGraph_for_.Net/blob/master/docs/Graph/index.md ) . <br />
49
+ When you save a graph, view [ GraphSave documentation] ( https://github.com/Guzik1/MathGraph_for_.Net/blob/master/docs/GraphSave/GraphSave.md ) .<br />
50
+ Examples available [ here] ( https://github.com/Guzik1/MathGraph_for_.Net/tree/master/Examples ) .
47
51
48
52
## Built with
49
53
- .Net Core 3.1
0 commit comments