We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Most property graph systems follow a typed topology, which is useful information for a path query synthesizer
(s:T1)-[e:T2]->(d:T3) (s:T1)-[e:T2]->(d:T4) (s:T1)-[e:T5]->(d:T6) ...
To simplify manipulation, this should be represented with some sort of typed representation vs a big string:
@dataclass class TypedTriple directed: bool source_type: str edge_type: str destination_type: str async def infer_typed_topology(...) -> List[TypedTriple]
Note that node/edge attributes are not represented, nor are details like path lengths
The text was updated successfully, but these errors were encountered:
bechbd
No branches or pull requests
Most property graph systems follow a typed topology, which is useful information for a path query synthesizer
To simplify manipulation, this should be represented with some sort of typed representation vs a big string:
Note that node/edge attributes are not represented, nor are details like path lengths
The text was updated successfully, but these errors were encountered: