NetworkAlgorithms class
Network family — class
Graph algorithms over NetworkNode/NetworkLink diagrams: PageRank, shortest paths, all simple paths, connectivity, and connected components. Links are treated as directed unless Bidirectional is set.
Members
| Member | Kind | Description |
|---|---|---|
static PageRankResult PageRank( IEnumerable<NetworkNode> nodes, IEnumerable<NetworkLink> links, double damping = 0.85, int maxIterations = 100, double tolerance = 1e-8) | Method | Computes PageRank scores. Dangling nodes distribute their rank evenly across all nodes. |
static void ApplyPageRank(PageRankResult result, SKColor? color = null) | Method | Applies PageRank scores visually: node scale (and optional color alpha) are normalized between the minimum and maximum scores. |
static List<NetworkNode> ShortestPath( NetworkNode from, NetworkNode to, IEnumerable<NetworkLink> links, bool weighted = true) | Method | Finds the shortest path (Dijkstra when weighted, BFS otherwise). Returns the node sequence including endpoints, or an empty list when unreachable. |
static List<List<NetworkNode>> AllSimplePaths( NetworkNode from, NetworkNode to, IEnumerable<NetworkLink> links, int maxPaths = 50, int maxDepth = 32) | Method | Enumerates simple (loop-free) paths between two nodes, depth-first, up to a cap. |
static bool IsConnected(IEnumerable<NetworkNode> nodes, IEnumerable<NetworkLink> links) | Method | Returns true when all nodes are reachable from the first node (ignoring link direction). |
static List<List<NetworkNode>> ConnectedComponents(IEnumerable<NetworkNode> nodes, IEnumerable<NetworkLink> links) | Method | Returns connected components (undirected view of the graph). |
static double PathCost(IReadOnlyList<NetworkNode> path, IEnumerable<NetworkLink> links, bool weighted = true) | Method | Sums the cost of a node path (edges matched by consecutive node pairs). |