Skip to main content
Mathematica

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

7
  • $\begingroup$ How can I then get a track of a mail to be send from La to Ka from your graph? $\endgroup$ Commented Dec 23, 2016 at 17:17
  • $\begingroup$ 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. $\endgroup$ Commented Dec 23, 2016 at 17:20
  • $\begingroup$ And if you want to work directly from the graph you can regenerate the matrix via WeightedAdjacencyMatrix. $\endgroup$ Commented Dec 23, 2016 at 17:51
  • $\begingroup$ Yep,I mean go only via mailing routes,and from La to Ka. $\endgroup$ Commented Dec 23, 2016 at 17:59
  • $\begingroup$ 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. $\endgroup$ Commented Dec 23, 2016 at 18:20