Crate sodg

This is a memory structure with vertices and edges between them, which we call Surging Object DiGraph (SODG), because it expects modifications comping from a user (through Sodg::add, Sodg::bind, and Sodg::put) and then decides itself when it’s time to delete some vertices (something similar to “garbage collection”). For example, here is how you create a simple graph with two vertices and an edge between them:

use sodg::Sodg;
let mut sodg = Sodg::empty();
sodg.add(0).unwrap();
sodg.add(1).unwrap();
sodg.bind(0, 1, "foo").unwrap();

Structs

DeadRelay

This Relay doesn’t even try to find anything, but returns an error.

LambdaRelay

This Relay can be made of a lambda function.

Script

It is a wrapper of a plain text with graph-modifying instructions, for example:

Sodg

This struct represents a Surging Object DiGraph (SODG).

Enums

Hex

It is an object-oriented representation of binary data in hexadecimal format, which can be put into vertices of the graph.

Traits

Relay

A relay that is used by Sodg::find() when it can’t find an attribute.

Type Definitions

Alert

Instances of this type can be used in Sodg::alert_on method, in order to ensure runtime consistency of data inside the graph.