Skip to content
This repository has been archived by the owner on Mar 27, 2019. It is now read-only.

Trust Graph Visualisation #36

Open
massar opened this issue Jan 6, 2015 · 3 comments
Open

Trust Graph Visualisation #36

massar opened this issue Jan 6, 2015 · 3 comments

Comments

@massar
Copy link
Member

massar commented Jan 6, 2015

It would be useful to have trust graphs embedded in the site so that one can see how one is connected to another person and thus how one could be introduced to a person one has not directly met.

@massar massar changed the title Trust Graph Generation Trust Graph Visualisation Jan 6, 2015
@morrowc
Copy link
Contributor

morrowc commented Jan 7, 2015

note that JTK had some code to do this, I think, and make a dot file to
be graphed from?

On 01/06/2015 04:22 PM, Jeroen Massar wrote:

It would be useful to have trust graphs embedded in the site so that one can see how one is connected to another person and thus how one could be introduced to a person one has not directly met.


Reply to this email directly or view it on GitHub:
#36

@massar
Copy link
Member Author

massar commented Jan 7, 2015

Yes, he has. That code renders the full trust-graph, which is something we should have at one point too.

This ticket is more about the direct connections one has and how one can reach somebody whose profile one is peeking at. The actual graph displayed that way will be much smaller.

I'll definitely check JTKs code to see what of his algorithm, can be used for this. Though likely I'll have to exclude various paths that are 'too long' thus it will be quite different ;)

@morrowc
Copy link
Contributor

morrowc commented Jan 7, 2015

On 01/07/2015 04:04 AM, Jeroen Massar wrote:

Yes, he has. That code renders the full trust-graph, which is
something we should have at one point too.

This ticket is more about the direct connections one has and how one
can reach somebody whose profile one is peeking at. The actual graph
displayed that way will be much smaller.

I'll definitely check JTKs code to see what of his algorithm, can be
used for this. Though likely I'll have to exclude various paths that
are 'too long' thus it will be quite different ;)

ah! ok, it seems like you could do some simple sql to pull out the
levels 2 or 3 or N away from you from the vouch table(s).

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Projects
None yet
Development

No branches or pull requests

2 participants