blob: 745f5e0e888c4e340b5ce1771076c387b52b7e23 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
|
This module implement a interesting graph application that is called the
'Social Relation Map'. It provides object-oriented way to retrieve many
social information that can be found in this map.
The new() constructor accepts one argument in the for of 'hashref of
arrayref'. The key to this hash is the name of relation, and the value of
the hash is a list of identities involved in this relation.
Take the synopsis for an example, the structure:
my $relation = {
'WorkWith' => [qw/Marry Rose/],
'ChatWith' => [qw/Marry Peacock/],
'DanceWith' => [qw/Rose Joan/],
'HackWith' => [qw/Gugod Autrijus/],
};
Defines 4 issues which have common people involves in, the relation
'WorkWith' involves Marry and Rose, and the relation 'ChatWith' involves
Marry and Peacock. By this 2 relations, we say that Marry is directly
connected to Rose and Peacock, and Rose and Peacock are connected to each
other indirectly, with degree of seperation 1. Likewise, Marry and Joan
are connected to each other with degree of seperation 2.
WWW: http://search.cpan.org/dist/Graph-SocialMap
Author: Kang-min Liu <gugod@gugod.org>
|
