Skip to content
Snippets Groups Projects
Commit f1cf296c authored by Jakub Janák's avatar Jakub Janák
Browse files

changed the syntax of in line latex

parent 908f36d8
No related branches found
No related tags found
No related merge requests found
......@@ -17,7 +17,7 @@ It is not particularly hard to define the problem, but it is tough to solve it e
The mathematical definition would be:
Given a directed, weighted graph $G = (N, E)$, where:
$N = \{v_1, v_2, \dots, v_n\} $ is a set of nodes,
$`N = \{v_1, v_2, \dots, v_n\} `$ is a set of nodes,
$E = \{e_1, e_2, \dots, e_n\} $ is a set of edges,
$w: E \to \mathbb{R}^+ $ is a weight function, returning the weight of an edge.
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment