Using iGraph in R studio. Please.

Light Gray $$ Ascending $($unless there are two, then each one goes the opposite way$)$

White $-$ Descending

Dark Gray $-$ Ascending

Green $-$ Descending

Yellow $-$ Ascending

Blue $-$ Descending

Purple $-$ Descending

Red $$ Descending $($with the exception of Anchorage to Los Angeles, which is ascending$)$

Orange $-$ Ascending

Task $1$:

Encode this graph in three ways, storing the length of the edge as well:

Adjacency Matrix

Edge List

Stemmed Edge ListIn each instance, you have connections from city to city $($i$.$e$.,$ a network$).$ Some cities are connected to each other with multiple paths. The weight of the path is the number of blocks connecting the cities $($for reference, the length of the path from Anchorage to Montreal is $3).$ For the purposes of this assignment, we will consider the edges to be directed in the following way $($alphabetically$)$: