How to display a simulator for shipping rate by size, weight and location on the frontpage?

I would like to know if there is a plugin I can use to display a simulator on the frontpage. In my platform, I just take care of forwarding packages that my clients have already purchased on other platforms that doesn’t deliver to them (outside the us). I need to give my clients a quote (on the frontpage), based on size, weight and address, so they know much they should pay if they use my service. Currently, I use UPS for the delivery. I think the plugin should use an api call so I can get the correct price (negotiated price UPS), add my marge and give the quote. I hope I am understandable.

Thank you very much for your help

How much weight can an Aarakocra carry when flying?

(related to Prison break with an Aarakocra)

The title pretty much says it all. Are the rules for flying creatures the same as for anyone else, using the Strength * 15 = weight in pounds formula ?


Some additional information about the Aarakocra’s own weight (from the PotA Player’s Companion):

Size. Aarakocra are about 5 feet tall. They have thin, lightweight bodies that weigh between 80 and 100 pounds. Your size is Medium.

With a Strength of 10, the Aarakocra should be able to carry 150 pounds, which is already a lot, even without flying.

Build Table of Edge Weight Sums

Is there a convenient way to build a table as generated by the code below where a 5th column (at the far right) could be added to the table that is the sum of the edge weights for the nodes in a given row. Then also be able to sort that table from smallest edge weight sum to largest edge weight sum?

Clear[edges,g] edges = {N1 -> N2, N1 -> N3, N1 -> N4,          N2 -> N5, N3 -> N5, N3 -> N6,          N4 -> N6, N5 -> N7, N6 -> N7};  g = Graph[       edges,        VertexLabels -> "Name",        EdgeWeight -> {1, 2, 3, 4, 5, 6, 7, 8, 9},        EdgeLabels -> {"EdgeWeight"},       EdgeLabelStyle -> Directive[Red, 20]     ]  WeightedAdjacencyMatrix[g] // MatrixForm  TableForm[FindPath[g, N1, N7, Infinity, All]] 

table with Ni

I’m looking for the sum of the edge weights of each row in the above table. For example, the last row would be generated as N1 N2 N5 N7 13, where 13 is the sum of the edge weights 1 (N1 -> N2) + 4 (N2 -> N5) + 8 (N5 -> N7) = 13. So, 13 would be the 5th column computed for each row in the above table generated by the last line of code in the above.

Get the list of all Weight attribute members

I have, in SSAS, a fact PERSONS which contains the Measures [Number of PERSONS] and [Weight]. The first one has the value 844. In order to achieve some calculus, I would like to get the list of all Weights, not only the list of the different ones.

The query

WITH member number as COUNT (NONEMPTY( [Measures].[Weight]   ))  SELECT number ON 0 FROM [mycube] 

produces: result

I don’t understand this result. It is not the result of an aggregation.

The query:

WITH member number as COUNT (NONEMPTY([Dim Date].[Date].[Date].members , [Measures].[Weight]   ))  SELECT number ON 0 FROM [mycube] 

used to bypass some aggregation produces: too many results

which is not the correct number.

An answer could to create a dimension (I could get the entire list with the function ‘.members’) but it is goes against the purpose of Weight, which is a measure, not a group.

thank you.

Find maximal subset with interesting weight function

You are given $ n$ rows of positive integers of length $ k$ . We define a weight function for every subset of given $ n$ rows as follows – for every $ i = 1, 2, \dots, k$ take the maximum value of $ i$ -th column (), then add up all the maximums.

For example, for $ n = 4$ , $ k = 2$ and rows $ (1, 4), (2, 3), (3, 2), (4, 1)$ the weight of subset $ (1, 4), (2, 3), (3, 2)$ is $ \max\{1, 2, 3\} + \max\{4, 3, 2\} = 3 + 4 = 7$ .

The question is, having $ m \leq n$ , find the subset of size $ m$ (from given $ n$ rows) with maximal weight.

The problem looks trivial when $ m \geq k$ , but how can one solve it for $ m < k$ ? Looks like dynamic programming on subsets could work for small $ k$ , isn’t it? Are there other ways to do it?

Oriented spanning tree of a directed multi-graph with minimum weight

I have problem of finding the minimum spanning tree of a simple graph, but the result is restricted by additional two types of condition:

  • There is a known root, which is s in the following example.
  • We know directions of some edges if they are chosen. These edges are chosen yet, or the problem becomes a Steiner tree problem.

Note that numbers on edges are their weights. So we will get s -> b -> c -> a if a normal min spanning tree is applied, but the direction of edge ac is wrong. On the other hand, we cannot use Chu–Liu/Edmonds’ algorithm for spanning arborescence of directed graphs, because we don’t know and cannot infer the direction of edge bc.

We can infer some edges’ directions according to the position of the root. For example, in the example, we know s -> b and s -> a.


Oriented Spanning Tree

In the final section of spanning tree, Wikipedia, oriented spanning tree is mentioned and a paper [levine2011sandpile] is referred. The problem fits the setting. It says:

Given a vertex v on a directed multigraph G, an oriented spanning tree T rooted at v is an acyclic subgraph of G in which every vertex other than v has outdegree 1.

Note that the term "outdegree" is a bit confusing, which I think should be "indegree". But it doesn’t matter, because it just restricts the simple subgraph to be a directed tree with root being source or sink.

For edges (in the original simple graph) whose directions are unknown, we add two directed edges between two vertices with inverse directions. Then we find the oriented spanning tree of this multi-graph. But it is not clear to me how an algorithm can be implemented according to that paper.


  • Levine, L. (2011). Sandpile groups and spanning trees of directed line graphs. Journal of Combinatorial Theory, Series A, 118(2), 350-364.
  • https://en.wikipedia.org/wiki/Spanning_tree

Does Improved Grab pull in the grappled regardless of weight?

Reviewing the choker I noticed the default strength is only 16. It caused me to wonder if an improved grab can pull a creature up in the air even if the strength does not have enough to carry (envision either a very heavy character or a magically strength reduced choker if you need to).

Improved grab itself seems silent on the issue, though it does mention weight when talking about moving the creature being grabbed which makes me suspect it would be limited:

It can even move (possibly carrying away the opponent), provided it can drag the opponent’s weight.

What is Strahd von Zarovich’s weight in bat form?

This question concerns D&D 5e. The relevant ability, with my emphasis, is as follows:

While in bat or wolf form, Strahd can’t speak. In bat form, his walking speed is 5 feet, and he has a flying speed of 30 feet. In wolf form, his walking speed is 40 feet. His statistics, other than his size and speed, are unchanged… (Curse of Strahd page 240)

Simply put, what does Strahd weigh as a bat? Since size and weight are not the same, I would argue that he simply becomes a (very heavy) Strahd-weighted bat. Is this correct?

Number of graphs that satisfies the property that edge weight is maximum of node values on which the edge is incident

I have an undirected weighted graph without multi edges. All the edge weights are whole numbers and known. I want to know in how many ways node values(node values are also whole numbers) can be assigned to the nodes such that the graph satisfies the condition that for every edge its edge weight is exactly equal to maximum of two node values this edge is incident on.

Can Mage Hand drag more weight than it can carry?

I have been watching/listening to Chance’s D&D Spellbook, which highlights a potential ‘loophole’ in that the spell doesn’t list how much the hang can drag, say if attached via a rope that weighs less than 10lbs.

Normally a spell only does what it says, but carrying and dragging seem closely enough related that there might be some room for interpretation.