Book a Demo
Topics
4
.
G
r
a
p
h
s
&
N
e
t
w
o
r
k
s
4
.
0
1
I
n
t
r
o
d
u
c
t
i
o
n
t
o
g
r
a
p
h
s
a
n
d
n
e
t
w
o
r
k
s
4
.
0
1
5
T
y
p
e
s
o
f
g
r
a
p
h
s
4
.
0
2
N
e
t
w
o
r
k
r
e
p
r
e
s
e
n
t
a
t
i
o
n
s
4
.
0
3
P
l
a
n
a
r
g
r
a
p
h
a
n
d
E
u
l
e
r
'
s
f
o
r
m
u
l
a
4
.
0
4
W
a
l
k
s
,
t
r
a
i
l
s
a
n
d
p
a
t
h
s
I
N
V
E
S
T
I
G
A
T
I
O
N
:
A
l
g
o
r
i
t
h
m
s
t
o
f
i
n
d
i
n
g
s
h
o
r
t
e
s
t
p
a
t
h
Lesson
4
.
0
5
E
u
l
e
r
i
a
n
a
n
d
H
a
m
i
l
t
o
n
i
a
n
g
r
a
p
h
s
Log in
Sign up
Book a Demo
Australia
WA
Year 12
INVESTIGATION: Algorithms to finding shortest path
Lesson
Interactive practice questions
There are no interactive problems for this subtopic
What is Mathspace
About Mathspace