71 lines
1.1 KiB
JSON
71 lines
1.1 KiB
JSON
|
{
|
||
|
|
"name": "Network algorithms",
|
||
|
|
"order": 4,
|
||
|
|
"challenges": [
|
||
|
|
{
|
||
|
|
"id": "59a5801209a6acac5983b614",
|
||
|
|
"title": "Shortest paths",
|
||
|
|
"description": [
|
||
|
|
""
|
||
|
|
],
|
||
|
|
"challengeSeed": [
|
||
|
|
""
|
||
|
|
],
|
||
|
|
"tests": [
|
||
|
|
""
|
||
|
|
]
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"id": "59a5801209a6acac5983a962",
|
||
|
|
"title": "Minimum spanning trees",
|
||
|
|
"description": [
|
||
|
|
""
|
||
|
|
],
|
||
|
|
"challengeSeed": [
|
||
|
|
""
|
||
|
|
],
|
||
|
|
"tests": [
|
||
|
|
""
|
||
|
|
]
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"id": "59a5801209a6acac5983a963",
|
||
|
|
"title": "Network flows",
|
||
|
|
"description": [
|
||
|
|
""
|
||
|
|
],
|
||
|
|
"challengeSeed": [
|
||
|
|
""
|
||
|
|
],
|
||
|
|
"tests": [
|
||
|
|
""
|
||
|
|
]
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"id": "59a5801209a6acac5983a964",
|
||
|
|
"title": "Algorithmic matching",
|
||
|
|
"description": [
|
||
|
|
""
|
||
|
|
],
|
||
|
|
"challengeSeed": [
|
||
|
|
""
|
||
|
|
],
|
||
|
|
"tests": [
|
||
|
|
""
|
||
|
|
]
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"id": "59a5801209a6acac5983a965",
|
||
|
|
"title": "The Transportation problem",
|
||
|
|
"description": [
|
||
|
|
""
|
||
|
|
],
|
||
|
|
"challengeSeed": [
|
||
|
|
""
|
||
|
|
],
|
||
|
|
"tests": [
|
||
|
|
""
|
||
|
|
]
|
||
|
|
}
|
||
|
|
]
|
||
|
|
}
|