Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have a directed-graph, each node is a complex data type.
Does anyone know How to build a data structure for this graph.
Like for the instance, picture here :
Thank in advance.
Looking at the image, it just looks like a directed graph. I assume what you mean by “complex data type” is that each vertex holds some sort of complex information, such as a hash table or something.
What I recommend you do if to create a dedicated Vertex class that holds the relevant information, then create a graph class using either an adjacency matrix or adjacency list implementation, depending on how dense/sparse/big/small the graph will be.