HeatMap / Shortest Path on undirected Graph wrongly paints / calculates · Issue #630 · gephi/gephi · GitHub
Skip to content
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
Closed
Labels
Milestone

Comments

@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
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 mentioned this issue Jun 23, 2012
eduramiba added a commit that referenced this issue Jun 24, 2012
@eduramiba
Copy link
Member

Hi oxling, thanks for the report and fix :)

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

No branches or pull requests

4 participants