summaryrefslogtreecommitdiff
path: root/assets/levels/eulerian/paths.xml
blob: c3fa8b7fdb73314a6f6260287ecbd75d163505b4 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
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>