diff options
| author | Leo Tenenbaum <pommicket@gmail.com> | 2018-08-20 20:34:57 -0400 |
|---|---|---|
| committer | Leo Tenenbaum <pommicket@gmail.com> | 2018-08-20 20:34:57 -0400 |
| commit | a4460f6d9453bbd7e584937686449cef3e19f052 (patch) | |
| tree | 037c208f1e20302ed048c0952ef8e3418add9c86 /assets/levels/eulerian/paths.xml | |
Initial commit0.0.0
Diffstat (limited to 'assets/levels/eulerian/paths.xml')
| -rw-r--r-- | assets/levels/eulerian/paths.xml | 37 |
1 files changed, 37 insertions, 0 deletions
diff --git a/assets/levels/eulerian/paths.xml b/assets/levels/eulerian/paths.xml new file mode 100644 index 0000000..c3fa8b7 --- /dev/null +++ b/assets/levels/eulerian/paths.xml @@ -0,0 +1,37 @@ +<level title="Eulerian Paths" description="Every graph where all the vertices except for 2 have an even;degree has an Eulerian path.;An Eulerian path is a path through the graph that goes through each edge exactly once.;Paths do not have to start and end in the same place" objective="Find an Eulerian path in this graph."/> +<global-vertex-protections protect="acd"/> +<global-edge-protections protect="acd"/> +<colors> + <color color="#FF0000" name="red"/> +</colors> +<graph> + <vertex x="300" y="400" id="top-l"/> + <vertex x="400" y="350" id="top-m"/> + <vertex x="500" y="400" id="top-r"/> + <vertex x="300" y="500" id="bot-l"/> + <vertex x="400" y="550" id="bot-m"/> + <vertex x="500" y="500" id="bot-r"/> + + <edge v1="top-l" v2="bot-l"/> + <edge v1="top-l" v2="bot-m"/> + <edge v1="top-l" v2="bot-r"/> + + <edge v1="top-m" v2="bot-l"/> + <edge v1="top-m" v2="bot-r"/> + + <edge v1="top-r" v2="bot-l"/> + <edge v1="top-r" v2="bot-m"/> + <edge v1="top-r" v2="bot-r"/> + + + <edge v1="bot-l" v2="bot-r"/> +</graph> +<rules/> +<path points="0"> + <edge color="any" op="+" val="1"/> +</path> +<values> + <var id="points" val="0"/> + <var id="objective" val="E"/> +</values> + |