What kind of data structures are these? Can someone please point out any links or books where I can read more about them.
Share
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.
What kind of data structures are these? Can someone please point out any links or books where I can read more about them.
You can also check out this paper. From DVK’s answer and that link, it sounds like they’re normal graphs, but with “attributes” on the nodes and edges. For example, if you were trying to build an image processor, you might initially construct a graph where each node represents a distinctly colored region (say, a person’s face vs. their shirt) and then edges represent visual adjacency (likely, a person’s head/neck is adjacent to both their shirt and the background of the image).
Then, you would assign attributes to the graph elements. The attribute for each region (node) could be its predominant color, and the attribute for each edge would be how much of their circumference the respective regions share.
As a different example, you a colored graph with edge weights is a simple example of an attributed graph.
Perhaps I could be more helpful with a little more information about why you’re looking into ARGs, since they’re defined pretty generally.