shashanksingh / toy_graph_db Goto Github PK

Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]

Describe the solution you'd like
A clear and concise description of what you want to happen.

Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.

Additional context
Add any other context or screenshots about the feature request here.

example : https://leetcode.com/problems/minimum-height-trees/

Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]

Describe the solution you'd like
A clear and concise description of what you want to happen.

Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.

Additional context
Add any other context or screenshots about the feature request here.

GRPC Client -----> GRPC Server ---> Storage backend

• Cycle detection
• Component detection in undirected

https://github.com/shashanksingh/toy_graph_db/wiki/%5BSpike%5D-Real-world-examples---Currency-Arbitirages

1. Finding depth and height of tree
2. Finding depth and height of nodes
3. Inorder travesal
4. Preorder traversal
5. Postorder Traversal

• Can autocomplete for English dictinary be good example?
• Or Finding all routes from to and from airport ? ( real data )
• Forex conversion ?
• Actual course schedule problem from a university ?
• Social connections ?

• Proto file needs to be created for schema
• on load sync schema to db.
• listen on rpc socket to add or query

docker compose will need to be updated

other examples

1. get me graphs that have 3 connected components

Is your feature request related to a problem? Please describe.
refactor code based on ABC to increase readability

Describe the solution you'd like

1. undirected graphs go in one directory
2. directed graphs go in one direction
3. graph class gets abstracts method hash , is_valid() , add_node(), travesal(type=allowed_type) , for tree allowed_type - (inoder, postorder, preorder), for graphs bfs, dfs

Describe alternatives you've considered

1. current situation makes it little unreadable and code is not shared