John Gemignani

@I33Buckler I'd be careful with StackOverflow answers that have few, if any, responses. That one, in particular, is not very helpful in my opinion. I feel the following **might** be...

> [@jrgemignani ](https://github.com/jrgemignani) Is it possible or are there plans to enable partitioning a graph node? That would help greatly with processing. At the moment the only solution obvious to...

@rafsun42 Thoughts?

@eyab Eya?

I am currently working on a patch for this. However, any input here is welcome.

I have created PR #997 to address this and the issue with using a duplicated vertex (self loop) mentioned in a previous MERGE PR.

Resolved

This is not supported nor recommended behavior. Internal representation of a graph in AGE can change and anything relying on a particular format can break. You should be using existing...

@M4rcxs Do you mean as a parameter of type list? For example: ``` lst = ['this', 'that', 1, 2, {name: "Jim"}] toUpper(lst) or toLower(lst) ``` If so, it doesn't really...

@MuhammadTahaNaveed @Zainab-Saad as they might be working on a related patch mentioned in #1000