Update Main with Changes from Developer

Add Longest path

Add simple tests for LongestPath

Rename check functions and add the check to the compute expressions

Add function to check if graph is Cyclic

Elevate usability

Fix Eccecentricety and Digraph docs

- mapEdges
- mapiEdges
- setEdgeData
- hasLoops
- isSimple
- getNodeLabel
- getSubgraphOfNodeSeq...

Add a function to calculate the longest path of an directed acyclic FGraph

Improve Usability

minor fixes

Practical changes

Add getSubGraphOfNodeSeq and getNeighourhoodSubgraphByHops

Add getNodeOverlap and getNodeOverlap

Depict unique edges
No longer returns the edge two times

Update Gilbert.fs to use probability as EdgeData for initDirectedAdjGraph

add getNodes to FGraph and AdjGraph

Louvain and modularity

Restore code falsely deleted in #64

Re-add code falsely deleted in #64, commit
a811bd24dd7375e69c93dc46d23040cc64f726d3

Developer

Undirected graph revival

fixed code comments, naming of weak component measures and tests

added support for finding and returning components from digraph

Update Louvain function

- Port Louvain from FGraph to AdjGraph
- This keeps FGraph as a directed graph

- fix ofSeq function to correctly add nodes with only self loops

Add centrality statistics

- Port all undirected FGraph functions to AdjGraph

Add nuget Reference for OptimizedPriorityQueue

add tests for:
- BetweennessCentrality
- Eccentricity
- ClosenessCentrality
- Distance functions

Rename EccentricityCentrality to just Eccentricity

Update Distance functions with FSharpAux functionality

add StarGraph and tests as mentioned in #51