dagger

Jul 31, 2021

Changes in this version

type Graph

+ func CustomGraph(nodes, edges, edgesFrom, edgesTo driver.Index) *Graph

Jul 28, 2021

Changes in this version

+ type Attributes map[string]interface

+ func (m Attributes) Copy() Attributes

+ func (m Attributes) Del(key string)

+ func (m Attributes) Exists(key string) bool

+ func (m Attributes) Filter(filter func(key string, v interface{}) bool) Attributes

+ func (m Attributes) Get(key string) interface{}

+ func (m Attributes) GetBool(key string) bool

+ func (m Attributes) GetInt(key string) int

+ func (m Attributes) GetString(key string) string

+ func (m Attributes) Range(iterator func(key string, v interface{}) bool)

+ func (m Attributes) Set(k string, v interface{})

+ func (m Attributes) SetAll(data map[string]interface{})

+ type Export struct

+ Edges []Edge

+ Nodes []Node

+ type Graph struct

+ func NewGraph() *Graph

+ func (g *Graph) BFS(edgeType string, rootNode Path, fn func(nodePath Node) bool)

+ func (g *Graph) Close()

+ func (g *Graph) DFS(edgeType string, rootNode Path, fn func(nodePath Node) bool)

+ func (g *Graph) DelEdge(id Path)

+ func (g *Graph) DelNode(id Path)

+ func (g *Graph) EdgeTypes() []string

+ func (g *Graph) Export() *Export

+ func (g *Graph) GetEdge(id Path) (Edge, bool)

+ func (g *Graph) GetNode(id Path) (Node, bool)

+ func (g *Graph) HasEdge(id Path) bool

+ func (g *Graph) HasNode(id Path) bool

+ func (g *Graph) Import(exp *Export) error

+ func (g *Graph) NodeTypes() []string

+ func (g *Graph) RangeEdges(edgeType string, fn func(e Edge) bool)

+ func (g *Graph) RangeEdgesFrom(edgeType string, id Path, fn func(e Edge) bool)

+ func (g *Graph) RangeEdgesTo(edgeType string, id Path, fn func(e Edge) bool)

+ func (g *Graph) RangeNodes(nodeType string, fn func(n Node) bool)

+ func (g *Graph) ReverseBFS(edgeType string, rootNode Path, fn func(nodePath Node) bool)

+ func (g *Graph) ReverseDFS(edgeType string, rootNode Path, fn func(nodePath Node) bool)

+ func (g *Graph) ReverseTopologicalSort(nodeType, edgeType string, fn func(node Node) bool)

+ func (g *Graph) SetEdge(from, to Path, node Node) (Edge, error)

+ func (g *Graph) SetNode(key Path, attr Attributes) Node

+ func (g *Graph) TopologicalSort(nodeType, edgeType string, fn func(node Node) bool)

type Node

+ Attributes Attributes

+ type Path struct

+ XID string

+ XType string

Oct 28, 2020

Changes in this version

+ func AnyType() primitive.Type

+ func DefaultType() primitive.Type

+ func HasEdge(id primitive.TypedID) bool

+ func RandomID() primitive.ID

type Edge

+ func GetEdge(id primitive.TypedID) (*Edge, bool)

type ForeignKey

+ XID string

+ XType string

+ func (f *ForeignKey) ID() string

+ func (f *ForeignKey) Path() string

+ func (f *ForeignKey) Type() string

type Node

+ func (n *Node) FilterEdgesFrom(edgeType primitive.Type, filter func(e *Edge) bool) []*Edge

+ func (n *Node) FilterEdgesTo(edgeType primitive.Type, filter func(e *Edge) bool) []*Edge

Oct 27, 2020

Changes in this version

+ func DelEdge(id primitive.TypedID)

+ func DelNode(id primitive.TypedID)

+ func StringID(id string) primitive.ID

+ func StringType(typ string) primitive.Type

Oct 27, 2020

Changes in this version

+ func EdgeCount() int

+ func ExportJSON(w io.Writer) error

+ func ForeignKey(typ, id string) primitive.TypedID

+ func ImportJSON(r io.Reader) error

+ func NodeCount() int

+ type Edge struct

+ func NewEdge(edgeType, id string, attributes map[string]interface{}, from, to *Node) (*Edge, error)

+ func (e *Edge) Del(key string)

+ func (e *Edge) From() *Node

+ func (e *Edge) FromJSON(bits []byte) error

+ func (e *Edge) Get(key string) interface{}

+ func (e *Edge) GetBool(key string) bool

+ func (e *Edge) GetInt(key string) int

+ func (e *Edge) GetString(key string) string

+ func (e *Edge) JSON() ([]byte, error)

+ func (e *Edge) Node() *Node

+ func (e *Edge) Patch(data map[string]interface{})

+ func (e *Edge) Range(fn func(key string, value interface{}) bool)

+ func (e *Edge) To() *Node

type Node

+ func (n *Node) Raw() map[string]interface{}

Oct 24, 2020

Changes in this version

type Node

+ func (n *Node) Del(key string)

+ func (n *Node) FromJSON(bits []byte) error

+ func (n *Node) Get(key string) interface{}

+ func (n *Node) GetBool(key string) bool

+ func (n *Node) GetInt(key string) int

+ func (n *Node) GetString(key string) string

Oct 24, 2020

Changes in this version

+ func Close()

+ func EdgeTypes() []string

+ func HasNode(id primitive.TypedID) bool

+ func NodeTypes() []string

+ func RangeEdgeTypes(edgeType primitive.Type, fn func(e *primitive.Edge) bool)

+ func RangeEdges(fn func(e *primitive.Edge) bool)

+ func RangeNodeTypes(typ primitive.Type, fn func(n *Node) bool)

+ func RangeNodes(fn func(n *Node) bool)

+ type Node struct

+ func GetNode(id primitive.TypedID) (*Node, bool)

+ func NewNode(nodeType, id string, attributes map[string]interface{}) *Node

+ func (n *Node) Connect(node *Node, relationship string) error

+ func (n *Node) EdgesFrom(fn func(e *primitive.Edge) bool)

+ func (n *Node) EdgesTo(fn func(e *primitive.Edge) bool)

+ func (n *Node) JSON() ([]byte, error)

+ func (n *Node) Patch(data map[string]interface{})

+ func (n *Node) Range(fn func(key string, value interface{}) bool)

+ func (n *Node) Remove()