How to manage edges in a node structure?

[josebalius]

Lets say I have two nodes and I want to keep a relationship between these two nodes. Is there anyway I can model that in a struct? For example:

type Node struct {
   Type string
   InEdges []Edge
   OutEdges []Edge
}

type Edge struct {
   Source string // string for Node id, or actual Node ?
   Target string
   Weight int
}

My question is, is there anyway to use Orient's native edges and graph features but still be able to model them with structs?

[dennwc]

I'm afraid that there is no way to achieve it with structs only. But there is a few options:

1. You can modify you SELECT statement and add an additional return value with a linked node using TRAVERSE or in/out() keywords and then load them into a struct.

2. You can query you node with any method you want, and add a fields with mapstructure:"E_in" or mapstructure:"E_out", there E stands for relation type. This field must be of []OIdentifiable type (or []RID).

I'll think of a way to implement this behavior. But it can only be optional, because driver will have to fetch all linked nodes. If you have a node with thousands of relations this can be a problem :)