Description:

graphs

Graph algorithms that do not specify a particular approach for representing a
Graph.
Functions in this package will take arguments that provide the mechanism for
traversing the graph. For example two common approaches for representing a
graph:
class Graph {
Map<Node, List<Node>> nodes;
}
class Node {
// Interesting data
}
copied to clipboard
class Graph {
Node root;
}
class Node {
List<Node> edges;
// Interesting data
}
copied to clipboard
Any representation can be adapted to the needs of the algorithm:

Some algorithms need to associate data with each node in the graph. If the
node type T does not correctly or efficiently implement hashCode or ==,
you may provide optional equals and/or hashCode functions are parameters.
Algorithms which need to traverse the graph take a edges function which provides the reachable nodes.

(node) => graph[node]
(node) => node.edges



Graphs that are resolved asynchronously will have similar functions which
return FutureOr.

License

For personal and professional use. You cannot resell or redistribute these repositories in their original state.

Share

• Share on Facebook
• Share on Twitter