Timeline for Graph construction and computing for grouped elements with multiple interactions
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 23, 2016 at 22:51 | history | edited | yode | CC BY-SA 3.0 | added 2 characters in body |
| Dec 23, 2016 at 18:47 | history | edited | b3m2a1 | CC BY-SA 3.0 | added 134 characters in body |
| Dec 23, 2016 at 18:40 | comment | added | b3m2a1 | @yode Not exactly. I edited the answer to reflect the fact that there are two identical adjacency matrices. The problem is really all in the rendering and by turning off arrows we get the desired effect. | |
| Dec 23, 2016 at 18:39 | history | edited | b3m2a1 | CC BY-SA 3.0 | added 134 characters in body |
| Dec 23, 2016 at 18:28 | comment | added | yode | So I thought you might have to look at the question again. :) | |
| Dec 23, 2016 at 18:20 | comment | added | b3m2a1 | I just realized I need to tweak the graph generating code (it's only generating a directed mail/meet pair for a pair of nodes, while those edges should really be undirected) but basically just use some variant of Dijkstra's algorithm. It operates on the adjacency matrix. | |
| Dec 23, 2016 at 17:59 | comment | added | yode | Yep,I mean go only via mailing routes,and from La to Ka. | |
| Dec 23, 2016 at 17:51 | comment | added | b3m2a1 | And if you want to work directly from the graph you can regenerate the matrix via WeightedAdjacencyMatrix. | |
| Dec 23, 2016 at 17:20 | comment | added | b3m2a1 | Do you want it to go only via mailing routes or is it passed via mail or meet routes? Is one route prioritized? It's a simple-enough problem from a weighted adjacency matrix, but I need more info first. | |
| Dec 23, 2016 at 17:17 | comment | added | yode | How can I then get a track of a mail to be send from La to Ka from your graph? | |
| Dec 23, 2016 at 16:56 | history | answered | b3m2a1 | CC BY-SA 3.0 |