graphs 0.1.0

  • Example
  • Installing
  • Versions
  • 97

Build Status

Graph algorithms which 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
class Graph {
  Node root;
class Node {
  List<Node> children;
  // Interesting data

Any representation can be adapted to the needs of the algorithm:

  • Some algorithms need to associate data with each node in the graph and it will be keyed by some type K that must work as a key in a HashMap. If nodes implement hashCode and ==, or if they are known to have one instance per logical node such that instance equality is sufficient, then the node can be passed through directly.
    • (node) => node
    • (node) =>
  • Algorithms which need to traverse the graph take a children function which provides the reachable nodes.
    • (node) => graph[node]
    • (node) => node.children

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


  • Initial release with an implementation of stronglyConnectedComponents and crawlAsync.


// Copyright (c) 2017, the Dart project authors.  Please see the AUTHORS file
// for details. All rights reserved. Use of this source code is governed by a
// BSD-style license that can be found in the LICENSE file.

import 'package:graphs/graphs.dart';

/// A representation of a directed graph.
/// Data is stored on the [Node] class.
class Graph {
  final Map<Node, List<Node>> nodes;

class Node {
  final String id;
  final int data;


  bool operator ==(Object other) => other is Node && == id;

  int get hashCode => id.hashCode;

  String toString() => '<$id -> $data>';

void main() {
  var nodeA = new Node('A', 1);
  var nodeB = new Node('B', 2);
  var nodeC = new Node('C', 3);
  var nodeD = new Node('D', 4);
  var graph = new Graph({
    nodeA: [nodeB, nodeC],
    nodeB: [nodeC, nodeD],
    nodeC: [nodeB, nodeD]

  var components = stronglyConnectedComponents<Node, Node>(
      graph.nodes.keys, (node) => node, (node) => graph.nodes[node]);


1. Depend on it

Add this to your package's pubspec.yaml file:

  graphs: "^0.1.0"

2. Install it

You can install packages from the command line:

with pub:

$ pub get

with Flutter:

$ flutter packages get

Alternatively, your editor might support pub get or packages get. Check the docs for your editor to learn more.

3. Import it

Now in your Dart code, you can use:

import 'package:graphs/graphs.dart';
Version Uploaded Documentation Archive
0.1.0 Dec 7, 2017 Go to the documentation of graphs 0.1.0 Download graphs 0.1.0 archive


This feature is new.
We welcome feedback.
More details: scoring.

We analyzed this package, and provided a score, details, and suggestions below.

  • completed on Feb 3, 2018
  • Dart: 2.0.0-dev.20.0
  • pana: 0.10.1


Describes how popular the package is relative to other packages. [more]
94 / 100
Code health derived from static analysis. [more]
100 / 100
Reflects how tidy and up-to-date the package is. [more]
100 / 100
Overall score:
Weighted score of the above. [more]


Detected platforms: Flutter, web, other

No platform restriction found in primary library package:graphs/graphs.dart.


  • The description is too short.

    Add more detail about the package, what it does and what is its target use case. Try to write at least 60 characters.

  • Package is pre-v1 release.

    While there is nothing inherently wrong with versions of 0.*.*, it usually means that the author is still experimenting with the general direction API.


Package Constraint Resolved Available
Direct dependencies
Dart SDK >=1.24.0 <2.0.0
Dev dependencies
analyzer ^0.30.0
path ^1.1.0
resource ^2.1.0
test ^0.12.0