Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
- API
  
  Reference documentation for the pkg.go.dev API
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

graphene

package module

Go to main page

Versions in this module

v0

v0.4.0

Aug 6, 2026

Changes in this version

+ var ErrTxDone = errors.New("graphene: transaction already finished")

+ func EdgesFromBFS(r *traversal.BFSResult) []*store.Edge

+ func FilterEdgesByLabel(es []*store.Edge, label store.EdgeType) []*store.Edge

+ func FilterNodesByLabel(ns []*store.Node, label store.NodeType) []*store.Node

+ func NodeIDsFromBFS(r *traversal.BFSResult) []store.NodeID

+ func NodeIDsFromPath(r *traversal.PathResult) []store.NodeID

+ func NodesFromBFS(r *traversal.BFSResult) []*store.Node

+ type Graph struct

+ func NewInMemory() *Graph

+ func Open(dir string) (*Graph, error)

+ func OpenWithOptions(dir string, opts disk.Options) (*Graph, error)

+ func (g *Graph) AddEdges(edges []*store.Edge) ([]store.EdgeID, error)

+ func (g *Graph) AddNodes(nodes []*store.Node) ([]store.NodeID, error)

+ func (g *Graph) BFS(origin store.NodeID, maxDepth int, dir store.Direction, ...) (*traversal.BFSResult, error)

+ func (g *Graph) BFSIDs(origin store.NodeID, maxDepth int, dir store.Direction, ...) ([]store.NodeID, error)

+ func (g *Graph) Begin() *Tx

+ func (g *Graph) Compact() error

+ func (g *Graph) DFS(origin store.NodeID, maxDepth int, dir store.Direction, ...) (*traversal.BFSResult, error)

+ func (g *Graph) DeclareOrderedEdgeProperty(key string) error

+ func (g *Graph) DeclareOrderedProperty(key string) error

+ func (g *Graph) Degree(id store.NodeID, edgeTypes []store.EdgeType) (int, error)

+ func (g *Graph) EdgeExists(src, dst store.NodeID, edgeTypes []store.EdgeType) (bool, error)

+ func (g *Graph) EdgesByAnyType(types []store.EdgeType) ([]store.EdgeID, error)

+ func (g *Graph) EdgesByAnyTypeSelector(selectors []string) ([]store.EdgeID, error)

+ func (g *Graph) EdgesByProperties(props map[string][]byte) ([]store.EdgeID, error)

+ func (g *Graph) EdgesByTypeSelector(selector string) ([]store.EdgeID, error)

+ func (g *Graph) EdgesWithProperties(props map[string][]byte) ([]*store.Edge, error)

+ func (g *Graph) ExplainEdgeQuery(q store.EdgeQuery) (store.QueryPlan, error)

+ func (g *Graph) ExplainNodeQuery(q store.NodeQuery) (store.QueryPlan, error)

+ func (g *Graph) FindPatterns(pattern *traversal.Pattern, scope []store.NodeID, maxMatches int) ([]traversal.SubgraphMatch, error)

+ func (g *Graph) Forensics() (*disk.Store, bool)

+ func (g *Graph) GetEdges(ids []store.EdgeID) (found []*store.Edge, missing []store.EdgeID, err error)

+ func (g *Graph) GetNodes(ids []store.NodeID) (found []*store.Node, missing []store.NodeID, err error)

+ func (g *Graph) HandleSignals(signals ...os.Signal) func()

+ func (g *Graph) HasCycle(origin store.NodeID, maxDepth int, edgeTypes []store.EdgeType) (bool, error)

+ func (g *Graph) InDegree(id store.NodeID, edgeTypes []store.EdgeType) (int, error)

+ func (g *Graph) IndexEdgeProperties(id store.EdgeID, props map[string][]byte) error

+ func (g *Graph) IndexNodeProperties(id store.NodeID, props map[string][]byte) error

+ func (g *Graph) InducedSubgraph(nodeIDs []store.NodeID) ([]*store.Node, []*store.Edge, error)

+ func (g *Graph) IsConnected(src, dst store.NodeID) (bool, error)

+ func (g *Graph) NeighboursByNodeType(id store.NodeID, dir store.Direction, nodeType store.NodeType, ...) ([]*store.Node, error)

+ func (g *Graph) NodesByAnyType(types []store.NodeType) ([]store.NodeID, error)

+ func (g *Graph) NodesByAnyTypeSelector(selectors []string) ([]store.NodeID, error)

+ func (g *Graph) NodesByProperties(props map[string][]byte) ([]store.NodeID, error)

+ func (g *Graph) NodesByTypeSelector(selector string) ([]store.NodeID, error)

+ func (g *Graph) NodesWithProperties(props map[string][]byte) ([]*store.Node, error)

+ func (g *Graph) OrderedProperties() (nodeKeys, edgeKeys []string)

+ func (g *Graph) OutDegree(id store.NodeID, edgeTypes []store.EdgeType) (int, error)

+ func (g *Graph) ProvenanceChain(origin store.NodeID, maxDepth int, edgeTypes []store.EdgeType) (*traversal.DFSResult, error)

+ func (g *Graph) QueryEdgeIDs(query store.EdgeQuery) ([]store.EdgeID, error)

+ func (g *Graph) QueryEdges(query store.EdgeQuery) ([]*store.Edge, error)

+ func (g *Graph) QueryNodeIDs(query store.NodeQuery) ([]store.NodeID, error)

+ func (g *Graph) QueryNodes(query store.NodeQuery) ([]*store.Node, error)

+ func (g *Graph) QueryRelationIDs(query store.RelationQuery) ([]store.EdgeID, error)

+ func (g *Graph) QueryRelations(query store.RelationQuery) ([]*store.Edge, error)

+ func (g *Graph) RebuildIndexes() error

+ func (g *Graph) ReindexPolicy() store.ReindexPolicy

+ func (g *Graph) SetReindexPolicy(p store.ReindexPolicy)

+ func (g *Graph) ShortestPath(src, dst store.NodeID, edgeTypes []store.EdgeType) (*traversal.PathResult, error)

+ func (g *Graph) ShouldCompact(p store.CompactionPolicy) (bool, string)

+ func (g *Graph) Stats() (*GraphStats, error)

+ func (g *Graph) StorageStats() (store.StorageStats, bool)

+ func (g *Graph) Sync() error

+ func (g *Graph) UpdateEdgeIndexed(e *store.Edge, props map[string][]byte) error

+ func (g *Graph) UpdateNodeIndexed(n *store.Node, props map[string][]byte) error

+ func (g *Graph) VerifyIndexes() error

+ type GraphStats struct

+ EdgeCount uint64

+ HasStorage bool

+ NodeCount uint64

+ Storage store.StorageStats

+ type Tx struct

+ func (tx *Tx) AddEdge(e *store.Edge) store.EdgeID

+ func (tx *Tx) AddNode(n *store.Node) store.NodeID

+ func (tx *Tx) As(ctx store.TxContext) *Tx

+ func (tx *Tx) Atomic() bool

+ func (tx *Tx) Attributed() bool

+ func (tx *Tx) Commit() error

+ func (tx *Tx) DeleteEdge(id store.EdgeID)

+ func (tx *Tx) DeleteNode(id store.NodeID)

+ func (tx *Tx) Len() (nodes, edges int)

+ func (tx *Tx) Ops() int

+ func (tx *Tx) Rollback() error

+ func (tx *Tx) UpdateEdge(e *store.Edge)

+ func (tx *Tx) UpdateNode(n *store.Node)

v0.3.0

Jul 22, 2026

v0.2.0

Jul 20, 2026

v0.1.3

May 31, 2026

v0.1.2

May 15, 2026

v0.1.1

Apr 25, 2026

v0.1.0

Apr 25, 2026