Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Last revisionBoth sides next revision | ||
| extensions:polytropes [2020/04/02 11:58] – [Download] joswig | extensions:polytropes [2020/04/02 12:06] – [Examples] joswig | ||
|---|---|---|---|
| Line 37: | Line 37: | ||
| > $G = new GraphAdjacency< | > $G = new GraphAdjacency< | ||
| </ | </ | ||
| - | The edges are defined along with their weights. | + | [For polymake 4.0 use '' |
| < | < | ||
| > $Weights = new EdgeMap< | > $Weights = new EdgeMap< | ||
| Line 132: | Line 132: | ||
| In the first solution, e.g., we see that $c$ and $d$ go through $b$ to reach $a$. | In the first solution, e.g., we see that $c$ and $d$ go through $b$ to reach $a$. | ||
| The next part of the output for each solution are the distances from each node to the target, written in the form $\alpha + \beta x$, where $x$ is the variable weight of the arc from $b$ to $a$. | The next part of the output for each solution are the distances from each node to the target, written in the form $\alpha + \beta x$, where $x$ is the variable weight of the arc from $b$ to $a$. | ||
| - | The distance from $a$ to itself is zero; the output " | + | The distance from $a$ to itself is zero; the output " |
| The distance from $b$ to $a$ is $x$. | The distance from $b$ to $a$ is $x$. | ||
| The distance from $c$ to $a$ is $2+x$. | The distance from $c$ to $a$ is $2+x$. | ||
| Line 143: | Line 143: | ||
| The feasibility can be checked via an LP oracle. | The feasibility can be checked via an LP oracle. | ||
| + | The sparse matrix notation works as follows: each row is a sparse vector. Each sparse vector starts with its length (in parantheses), | ||