package Graph::Feather;
use strict;
use warnings;
use DBI;
use DBD::SQLite;
use version;

our $VERSION = '0.09';

our $VERSION_INT =
  1_000_000 * version->parse($VERSION)->numify;

# Archive::Zip crc32 of 'Graph::Feather'
our $APPLICATION_ID = -801604570;

sub new {
  my ($class, %options) = @_;

  my $self = bless {
  }, $class;

  my $db_file = ':memory:';

  $self->{dbh} = DBI
    ->connect("dbi:SQLite:dbname=$db_file", "", "");

  local $self->{dbh}->{sqlite_allow_multiple_statements} = 1;

  ###################################################################
  # Deploy DB schema

  $self->{dbh}->do(sprintf q{
    PRAGMA application_id = %i;
    PRAGMA user_version = %u;
  }, $APPLICATION_ID, $VERSION_INT);

  $self->{dbh}->do(q{

    -----------------------------------------------------------------
    -- Pragmata
    -----------------------------------------------------------------

    PRAGMA foreign_keys = ON;
    PRAGMA synchronous  = OFF;
    PRAGMA journal_mode = OFF;
    PRAGMA locking_mode = EXCLUSIVE;

    -----------------------------------------------------------------
    -- Graph
    -----------------------------------------------------------------

    CREATE TABLE Graph_Attribute(
      attribute_name UNIQUE NOT NULL,
      attribute_value
    );

    -----------------------------------------------------------------
    -- Vertices
    -----------------------------------------------------------------

    CREATE TABLE Vertex(
      vertex_name UNIQUE NOT NULL
    );

    CREATE TABLE Vertex_Attribute(
      vertex NOT NULL,
      attribute_name NOT NULL,
      attribute_value,
      UNIQUE(vertex, attribute_name),
      FOREIGN KEY (vertex)
        REFERENCES Vertex(vertex_name)
        ON DELETE CASCADE
        ON UPDATE CASCADE
    );

    -----------------------------------------------------------------
    -- Edges
    -----------------------------------------------------------------

    CREATE TABLE Edge(
      src NOT NULL,
      dst NOT NULL,
      UNIQUE(src, dst),
      FOREIGN KEY (src)
        REFERENCES Vertex(vertex_name)
        ON DELETE CASCADE
        ON UPDATE CASCADE
      FOREIGN KEY (dst)
        REFERENCES Vertex(vertex_name)
        ON DELETE CASCADE 
        ON UPDATE CASCADE
    );

    -- Can use covering index instead
    -- CREATE INDEX idx_Edge_src
    --   ON Edge (src);

    CREATE INDEX idx_Edge_dst
      ON Edge (dst);

    CREATE TABLE Edge_Attribute(
      src NOT NULL,
      dst NOT NULL,
      attribute_name NOT NULL,
      attribute_value,
      UNIQUE(src, dst, attribute_name),
      FOREIGN KEY (src, dst)
        REFERENCES Edge(src, dst)
        ON DELETE CASCADE
        ON UPDATE CASCADE
    );

    -----------------------------------------------------------------
    -- Triggers that add vertices and edges when needed elsewhere
    -----------------------------------------------------------------

    CREATE TRIGGER trigger_Edge_insert
      BEFORE INSERT ON Edge
      BEGIN
        INSERT OR IGNORE
        INTO Vertex(vertex_name)
        VALUES(NEW.src);

        INSERT OR IGNORE
        INTO Vertex(vertex_name)
        VALUES(NEW.dst);
      END;

    CREATE TRIGGER trigger_Vertex_Attribute_insert
      BEFORE INSERT ON Vertex_Attribute
      BEGIN
        INSERT OR IGNORE
        INTO Vertex(vertex_name)
        VALUES(NEW.vertex);
      END;

    CREATE TRIGGER trigger_Edge_Attribute_insert
      BEFORE INSERT ON Edge_Attribute
      BEGIN
        INSERT OR IGNORE
        INTO Edge(src, dst)
        VALUES(NEW.src, NEW.dst);
      END;

  });

  ###################################################################
  # Register hook to synchronise attribute Perl objects

  $self->{dbh}->sqlite_update_hook(sub {
    return unless $_[0] == 9; # DBD::SQLite::DELETE
    delete $self->{ $_[2] }{ $_[3] };
  });

  ###################################################################
  # Process options

  $self->add_vertices(@{ $options{vertices} })
    if exists $options{vertices};

  $self->add_edges(@{ $options{edges} })
    if exists $options{edges};

  return $self;
};

#####################################################################
# DB helpers
#####################################################################

sub _prepare {
  my ($self, $statement, $attr, @other) = @_;

  # TODO(bh): As of 2018-02 effect/purpose of %attr seems
  # undefined in DBI documentation. So we fail on them here.
  if ($attr or @other) {
    ...
  }

  $self->{cache}{$statement} //= $self->{dbh}->prepare($statement);
  return $self->{cache}{$statement};
}

#####################################################################
# Basics
#####################################################################

sub add_vertex {
  my ($self, $v) = @_;
  add_vertices($self, $v);
}

sub add_edge {
  my ($self, $src, $dst) = @_;
  add_edges($self, [$src, $dst]);
}

sub has_vertex {
  my ($self, $v) = @_;

  my $sth = $self->_prepare(q{
    SELECT 1 FROM Vertex WHERE vertex_name = ?
  });

  my ($result) = $self->{dbh}->selectrow_array($sth, {}, $v);

  return !!$result;
}

sub has_edge {
  my ($self, $src, $dst) = @_;
  
  my $sth = $self->_prepare(q{
    SELECT 1 FROM Edge WHERE src = ? AND dst = ?
  });

  my ($result) = $self->{dbh}->selectrow_array($sth, {}, $src, $dst);

  return !!$result;
}

sub delete_vertex {
  my ($self, $v) = @_;

  delete_vertices($self, $v);
}

sub delete_vertices {
  my ($self, @vertices) = @_;
  
#  delete_vertex_attributes($self, $_) for @vertices;

  my $sth = $self->_prepare(q{
    DELETE FROM Vertex WHERE vertex_name = ?
  });

  $self->{dbh}->begin_work();
  $sth->execute($_) for @vertices;
  $sth->finish();
  $self->{dbh}->commit();
}

sub delete_edge {
  my ($self, $src, $dst) = @_;
  feather_delete_edges($self, [$src, $dst]);
}

sub delete_edges {
  my ($self, @vertices) = @_;
  my @edges;

  while (@vertices) {
    my ($src, $dst) = splice @vertices, 0, 2;
    warn 'delete_edges takes vertex list, not list of vertex pairs'
      if ref $src; 
    push @edges, [ $src, $dst ];
  }

  $self->feather_delete_edges(@edges);
}

sub feather_delete_edges {
  my ($self, @edges) = @_;
  
  delete_edge_attributes($self, @$_) for @edges;

  my $sth = $self->_prepare(q{
    DELETE FROM Edge WHERE src = ? AND dst = ?
  });

  $self->{dbh}->begin_work();
  $sth->execute(@$_) for @edges;
  $sth->finish();
  $self->{dbh}->commit();
}

#####################################################################
# Mutators
#####################################################################

sub add_vertices {
  my ($self, @vertices) = @_;

  my $sth = $self->_prepare(q{
    INSERT OR IGNORE INTO Vertex(vertex_name) VALUES (?)
  });

  $self->{dbh}->begin_work();
  $sth->execute($_) for @vertices;
  $sth->finish();
  $self->{dbh}->commit;
}

sub add_edges { 
  my ($self, @edges) = @_;

  my $sth = $self->_prepare(q{
    INSERT OR IGNORE INTO Edge(src, dst) VALUES (?, ?)
  });

  $self->{dbh}->begin_work();
  $sth->execute(@$_) for @edges;
  $sth->finish();
  $self->{dbh}->commit();
}

#####################################################################
# Accessors
#####################################################################

sub vertices {
  my ($self) = @_;

  my $sth = $self->_prepare(q{
    SELECT vertex_name FROM Vertex
  });

  return map { @$_ } $self->{dbh}->selectall_array($sth);
}

sub edges {
  my ($self) = @_;

  my $sth = $self->_prepare(q{
    SELECT src, dst FROM Edge
  });

  return $self->{dbh}->selectall_array($sth);
}

sub successors {
  my ($self, $v) = @_;

  my $sth = $self->_prepare(q{
    SELECT dst FROM Edge WHERE src = ?
  });

  return map { @$_ } $self->{dbh}->selectall_array($sth, {}, $v);
}

sub all_successors {
  my ($self, $v) = @_;

  my $sth = $self->_prepare(q{
    WITH RECURSIVE all_successors(v) AS (
      SELECT dst FROM Edge WHERE src = ?
      
      UNION
      
      SELECT dst
      FROM Edge
        INNER JOIN all_successors
          ON (Edge.src = all_successors.v)
    )
    SELECT v FROM all_successors
  });

  return map { @$_ } $self->{dbh}->selectall_array($sth, {}, $v);
}

sub successorless_vertices {
  my ($self) = @_;

  my $sth = $self->_prepare(q{
    SELECT vertex_name
    FROM Vertex
      LEFT JOIN Edge
        ON (Vertex.vertex_name = Edge.src)
    WHERE Edge.dst IS NULL
  });

  return map { @$_ } $self->{dbh}->selectall_array($sth);
}

sub predecessors {
  my ($self, $v) = @_;

  my $sth = $self->_prepare(q{
    SELECT src FROM Edge WHERE dst = ?
  });

  return map { @$_ } $self->{dbh}->selectall_array($sth, {}, $v);
}

sub all_predecessors {
  my ($self, $v) = @_;

  my $sth = $self->_prepare(q{
    WITH RECURSIVE all_predecessors(v) AS (
      SELECT src FROM Edge WHERE dst = ?
      
      UNION
      
      SELECT src
      FROM Edge
        INNER JOIN all_predecessors
          ON (Edge.dst = all_predecessors.v)
    )
    SELECT v FROM all_predecessors
  });

  return map { @$_ } $self->{dbh}->selectall_array($sth, {}, $v);
}

sub predecessorless_vertices {
  my ($self) = @_;

  my $sth = $self->_prepare(q{
    SELECT vertex_name
    FROM Vertex
      LEFT JOIN Edge
        ON (Vertex.vertex_name = Edge.dst)
    WHERE Edge.src IS NULL
  });

  return map { @$_ } $self->{dbh}->selectall_array($sth);
}

#####################################################################
# Degree
#####################################################################

sub edges_at {
  my ($self, $v) = @_;

  return $self->{dbh}->selectall_array(q{
    SELECT src, dst
    FROM Edge
    WHERE (?) IN (src, dst)
  }, {}, $v);
}

sub edges_to {
  my ($self, $v) = @_;

  my $sth = $self->_prepare(q{
    SELECT src, dst
    FROM Edge
    WHERE dst = ?
  });

  return $self->{dbh}->selectall_array($sth, {}, $v);
}

sub edges_from {
  my ($self, $v) = @_;

  my $sth = $self->_prepare(q{
    SELECT src, dst
    FROM Edge
    WHERE src = ?
  });

  return $self->{dbh}->selectall_array($sth, {}, $v);
}

#####################################################################
# Attributes
#####################################################################

#####################################################################
# Vertex Attributes
#####################################################################

sub set_vertex_attribute {
  my ($self, $v, $name, $value) = @_;

  delete_vertex_attribute($self, $v, $name);

  my $sth = $self->_prepare(q{
    INSERT INTO Vertex_Attribute(
      vertex, attribute_name, attribute_value
    )
    VALUES (?, ?, ?)
  });

  $sth->execute($v, $name, $value);

  my $id = $self->{dbh}->sqlite_last_insert_rowid();

  $sth->finish();

  $self->{Vertex_Attribute}{ $id } = $value;
}

sub _get_vertex_attribute_value_id {
  my ($self, $v, $name) = @_;

  my $sth = $self->_prepare(q{
    SELECT rowid
    FROM Vertex_Attribute
    WHERE vertex = ?
      AND attribute_name = ?
  });

  my ($rowid) = $self->{dbh}->selectrow_array($sth, {}, $v, $name);

  return $rowid;
}

sub get_vertex_attribute {
  my ($self, $v, $name) = @_;

  my $rowid = _get_vertex_attribute_value_id($self, $v, $name);
  return unless defined $rowid;
  return $self->{Vertex_Attribute}{ $rowid };
}

sub set_vertex_attributes {
  my ($self, $v, $attr) = @_;

  $self->delete_vertex_attributes($v);
  $self->add_vertex($v);
  $self->set_vertex_attribute($v, $_, $attr->{$_})
    for keys %$attr;
}

sub get_vertex_attributes {
  my ($self, $v) = @_;

  my $sth = $self->_prepare(q{
    SELECT
      rowid,
      attribute_name
    FROM Vertex_Attribute
    WHERE vertex = ?
  });

  my @result;

  for ($self->{dbh}->selectall_array($sth, {}, $v)) {
    push @result,
      $_->[1],
      $self->{Vertex_Attribute}{ $_->[0] };
  }

  return undef unless $self->has_vertex($v);  
  return { @result };
}

sub has_vertex_attribute {
  my ($self, $v, $name) = @_;
  my $rowid = _get_vertex_attribute_value_id($self, $v, $name);
  return defined $rowid;
}

sub delete_vertex_attribute {
  my ($self, $v, $name) = @_;

  my $sth = $self->_prepare(q{
    DELETE
    FROM Vertex_Attribute
    WHERE vertex = ?
      AND attribute_name = ?
  });

  $sth->execute($v, $name);
  $sth->finish();
}

sub get_vertex_attribute_names {
  my ($self, $v) = @_;

  my $sth = $self->_prepare(q{
    SELECT attribute_name
    FROM Vertex_Attribute
    WHERE vertex = ?
  });

  return map { @$_ } $self->{dbh}->selectall_array($sth, {}, $v);
}

sub delete_vertex_attributes {
  my ($self, $v) = @_;

  my $sth = $self->_prepare(q{
    DELETE
    FROM Vertex_Attribute
    WHERE vertex = ?
  });

  $sth->execute($v);
  $sth->finish();
}

#####################################################################
# Edge Attributes
#####################################################################

sub set_edge_attribute {
  my ($self, $src, $dst, $name, $value) = @_;

  delete_edge_attribute($self, $src, $dst, $name);

  my $sth = $self->_prepare(q{
    INSERT INTO Edge_Attribute(
      src, dst, attribute_name, attribute_value
    )
    VALUES (?, ?, ?, ?)
  });

  $sth->execute($src, $dst, $name, $value);

  my $id = $self->{dbh}->sqlite_last_insert_rowid();

  $sth->finish();

  $self->{Edge_Attribute}{ $id } = $value;
}

sub _get_edge_attribute_value_id {
  my ($self, $src, $dst, $name) = @_;

  my $sth = $self->_prepare(q{
    SELECT rowid
    FROM Edge_Attribute
    WHERE src = ?
      AND dst = ?
      AND attribute_name = ?
  });

  my ($rowid) = $self->{dbh}->selectrow_array($sth,
    {}, $src, $dst, $name);

  return $rowid;
}

sub get_edge_attribute {
  my ($self, $src, $dst, $name) = @_;

  my $rowid = _get_edge_attribute_value_id($self, $src, $dst, $name);
  return unless defined $rowid;
  return $self->{Edge_Attribute}{ $rowid };
}

sub get_edge_attributes {
  my ($self, $src, $dst) = @_;

  my $sth = $self->_prepare(q{
    SELECT
      rowid,
      attribute_name
    FROM Edge_Attribute
    WHERE src = ?
      AND dst = ?
  });

  my @result;

  for ($self->{dbh}->selectall_array($sth, {}, $src, $dst)) {
    push @result,
      $_->[1],
      $self->{Edge_Attribute}{ $_->[0] };
  }
  
  return { @result };
}

sub has_edge_attribute {
  my ($self, $src, $dst, $name) = @_;
  my $rowid = _get_edge_attribute_value_id($self, $src, $dst, $name);
  return defined $rowid;
}

sub set_edge_attributes {
  my ($self, $src, $dst, $attr) = @_;

  $self->delete_edge_attributes($src, $dst);
  $self->add_edge($src, $dst);
  $self->set_edge_attribute($src, $dst, $_, $attr->{$_})
    for keys %$attr;
}

sub delete_edge_attribute {
  my ($self, $src, $dst, $name) = @_;

  my $sth = $self->_prepare(q{
    DELETE
    FROM Edge_Attribute
    WHERE src = ?
      AND dst = ?
      AND attribute_name = ?
  });

  $sth->execute($src, $dst, $name);
  $sth->finish();
}

sub get_edge_attribute_names {
  my ($self, $src, $dst) = @_;

  my $sth = $self->_prepare(q{
    SELECT attribute_name
    FROM Edge_Attribute
    WHERE src = ?
      AND dst = ?
  });

  return map { @$_ } $self->{dbh}->selectall_array($sth,
    {}, $src, $dst);
}

sub delete_edge_attributes {
  my ($self, $src, $dst) = @_;

  my $sth = $self->_prepare(q{
    DELETE
    FROM Edge_Attribute
    WHERE src = ?
      AND dst = ?
  });

  $sth->execute($src, $dst);
  $sth->finish();
}

#####################################################################
# Graph Attributes
#####################################################################

sub set_graph_attribute {
  my ($self, $name, $value) = @_;

  delete_graph_attribute($self, $name);

  my $sth = $self->_prepare(q{
    INSERT INTO Graph_Attribute(
      attribute_name, attribute_value
    )
    VALUES (?, ?)
  });

  $sth->execute($name, $value);

  my $id = $self->{dbh}->sqlite_last_insert_rowid();

  $sth->finish();

  $self->{Graph_Attribute}{ $id } = $value;
}

sub _get_graph_attribute_value_id {
  my ($self, $name) = @_;

  my $sth = $self->_prepare(q{
    SELECT rowid
    FROM Graph_Attribute
    WHERE attribute_name = ?
  });

  my ($rowid) = $self->{dbh}->selectrow_array($sth, {}, $name);

  return $rowid;
}

sub get_graph_attribute {
  my ($self, $name) = @_;

  my $rowid = _get_graph_attribute_value_id($self, $name);
  return unless defined $rowid;
  return $self->{Graph_Attribute}{ $rowid };
}

sub get_graph_attributes {
  my ($self) = @_;

  my $sth = $self->_prepare(q{
    SELECT
      rowid,
      attribute_name
    FROM Graph_Attribute
  });

  my @result;

  for ($self->{dbh}->selectall_array($sth, {})) {
    push @result,
      $_->[1],
      $self->{Graph_Attribute}{ $_->[0] };
  }
  
  return { @result };
}

sub has_graph_attribute {
  my ($self, $name) = @_;
  my $rowid = _get_graph_attribute_value_id($self, $name);
  return defined $rowid;
}

sub set_graph_attributes {
  my ($self, $attr) = @_;

  $self->delete_graph_attributes();
  $self->set_graph_attribute($_, $attr->{$_})
    for keys %$attr;
}

sub delete_graph_attribute {
  my ($self, $name) = @_;

  my $sth = $self->_prepare(q{
    DELETE
    FROM Graph_Attribute
    WHERE attribute_name = ?
  });

  $sth->execute($name);
  $sth->finish();
}

sub get_graph_attribute_names {
  my ($self) = @_;

  my $sth = $self->_prepare(q{
    SELECT attribute_name
    FROM Graph_Attribute
  });

  return map { @$_ } $self->{dbh}->selectall_array($sth);
}

sub delete_graph_attributes {
  my ($self) = @_;

  my $sth = $self->_prepare(q{
    DELETE
    FROM Graph_Attribute
  });

  $sth->execute();
  $sth->finish();
}

#####################################################################
# Extensions not provided by Graph::Directed
#####################################################################

sub _copy_vertices_edges_attributes {
  my ($lhs, $rhs) = @_;

  # copy vertices 
  $rhs->add_vertices($lhs->vertices);

  # copy edges
  $rhs->add_edges($lhs->edges);

  # TODO(bh): use new plural methods instead

  # copy graph attributes
  for my $n ($lhs->get_graph_attribute_names) {
    $rhs->set_graph_attribute($n,
      $lhs->get_graph_attribute($n));
  }

  # copy vertex attributes
  for my $v ($lhs->vertices) {
    for my $n ($lhs->get_vertex_attribute_names($v)) {
      $rhs->set_vertex_attribute($v, $n,
        $lhs->get_vertex_attribute($v, $n));
    }
  }

  # copy edge attributes
  for my $e ($lhs->edges) {
    my ($src, $dst) = @$e;
    for my $n ($lhs->get_edge_attribute_names($src, $dst)) {
      $rhs->set_edge_attribute($src, $dst, $n,
        $lhs->get_edge_attribute($src, $dst, $n));
    }
  }
}

sub feather_export_to {
  my ($self, $target) = @_;
  _copy_vertices_edges_attributes($self, $target);
}

sub feather_import_from {
  my ($self, $source) = @_;
  _copy_vertices_edges_attributes($source, $self);
}

sub _feather_restore_from_file {
  my ($self, $path) = @_;

  $self->{dbh}->begin_work();

  $self->{dbh}->sqlite_backup_from_file($path);

  my $sth1 = $self->_prepare(q{
    PRAGMA application_id
  });

  my ($application_id) = $self->{dbh}->selectrow_array($sth1);

  my $sth2 = $self->_prepare(q{
    PRAGMA user_version
  });

  my ($user_version) = $self->{dbh}->selectrow_array($sth2);

  die "$path was not created by this version of Graph::Feather"
    unless $application_id eq $APPLICATION_ID
      and $user_version eq $VERSION_INT;

  $self->{dbh}->commit();

  # The following is needed because attribute values have a
  # dual life to support Perl references as attribute values.

  $self->set_graph_attribute(@$_) for
    $self->{dbh}->selectall_array(q{
      SELECT attribute_name, attribute_value
      FROM Graph_Attribute});

  $self->set_vertex_attribute(@$_) for
    $self->{dbh}->selectall_array(q{
      SELECT vertex, attribute_name, attribute_value
      FROM Vertex_Attribute});

  $self->set_edge_attribute(@$_) for
    $self->{dbh}->selectall_array(q{
      SELECT src, dst, attribute_name, attribute_value
      FROM Edge_Attribute});
}

1;

__END__

=head1 NAME

Graph::Feather - Like Graph::Directed basics, but with SQLite backend

=head1 SYNOPSIS

  use Graph::Feather;
  my $g = Graph::Feather->new;

  $g->add_edge(...);
  $g->has_edge(...)
  $g->delete_edge(...);
  ...

=head1 DESCRIPTION

Light-weight drop-in replacement for Graph::Directed using SQLite to
store directed graph data. Only basic graph manipulation functions
are supported. Some applications may find this module faster and/or
use less memory than Graph::Directed, particularily when using edge
or vertex attributes.

The test suite ensures the behavior of each method is equivalent to
those in Graph::Directed when called with legal arguments.

=head1 CONSTRUCTOR

=over

=item new(%options)

The C<%options> hash supports the following keys:

=over

=item vertices

Array of vertices.

=item edges

Array of edges.

=back

=back

=head1 METHODS

See the documentation of Graph::Directed for details:

=over

=item add_vertex

=item add_edge

=item has_vertex

=item has_edge

=item delete_vertex

=item delete_vertices

=item delete_edge

=item delete_edges

=item add_vertices

=item add_edges

=item vertices

=item edges

=item successors

=item all_successors

=item successorless_vertices

=item predecessors

=item all_predecessors

=item predecessorless_vertices

=item edges_at

=item edges_to

=item edges_from

=item set_vertex_attribute

=item get_vertex_attribute

=item has_vertex_attribute

=item delete_vertex_attribute

=item set_vertex_attributes

=item get_vertex_attributes

=item get_vertex_attribute_names

=item delete_vertex_attributes

=item set_edge_attribute

=item get_edge_attribute

=item has_edge_attribute

=item delete_edge_attribute

=item set_edge_attributes

=item get_edge_attributes

=item get_edge_attribute_names

=item delete_edge_attributes

=item set_graph_attribute

=item get_graph_attribute

=item has_graph_attribute

=item set_graph_attributes

=item delete_graph_attribute

=item get_graph_attributes

=item get_graph_attribute_names

=item delete_graph_attributes

=back

=head1 EXTENSIONS

=over

=item feather_export_to($compatible_graph)

Adds vertices, edges, their attributes, and any graph attributes
to the target graph, overwriting any existing attributes.

=item feather_import_from($compatible_graph)

Adds vertices, edges, their attributes, and any graph attributes
from the other graph, overwriting any existing attributes.

=item feather_delete_edges(@edges)

In the original Graph module, C<delete_edges> takes a flat list of
vertices instead of a list of vertex pairs. This function takes a
list of vertex pairs instead.

=back

=head1 TODO

=over

=item * ...

=back

=head1 BUG REPORTS

Please report bugs in this module via
L<http://rt.cpan.org/NoAuth/Bugs.html?Dist=Graph-Feather>

=head1 SEE ALSO

  * Graph::Directed

=head1 ACKNOWLEDGEMENTS

Thanks to the people on #perl on Freenode for a discussion on how to
name the module.

=head1 AUTHOR / COPYRIGHT / LICENSE

  Copyright (c) 2017-2018 Bjoern Hoehrmann <bjoern@hoehrmann.de>.
  This module is licensed under the same terms as Perl itself.

=cut