New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

HeatMap / Shortest Path on undirected Graph wrongly paints / calculates #630

Closed
Tanqu opened this Issue May 24, 2012 · 2 comments

Comments

Projects
None yet
4 participants
@Tanqu
Copy link

Tanqu commented May 24, 2012

One example (save in test.csv and load undirected):
0,1,2,3
1,0,4,5
2,0,6,7
3,0,8,9
4,1,6,8
5,1,7,9
6,2,4,9
7,2,8,5
8,4,3,7
9,3,5,6

The network diameter is (correctly) calculated as 2. But the heatmap and shortest path features paint/calculate longer distances than 2 on some nodes/pairs. Just use heatmap on multiple nodes and some of them will show a max distance of 3.

@oxling

This comment has been minimized.

Copy link
Contributor

oxling commented Jun 23, 2012

It looks like the implementation of Dijkstra's algorithm is incorrectly returning a distance of 3 for certain nodes. Possibly related to the closed issue #472?

oxling added a commit to oxling/gephi that referenced this issue Jun 23, 2012

@oxling oxling referenced this issue Jun 23, 2012

Merged

Issue #630 #647

eduramiba added a commit that referenced this issue Jun 24, 2012

@eduramiba

This comment has been minimized.

Copy link
Member

eduramiba commented Jun 24, 2012

Hi oxling, thanks for the report and fix :)

@eduramiba eduramiba closed this Jun 24, 2012

@mbastian mbastian added Fix Released and removed Fix Committed labels Nov 21, 2015

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment