Jordi/obsidian
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

vault backup: 2023-04-19 08:26:49

Browse Source
This commit is contained in:
Jordi
2023-04-19 08:26:50 +02:00
parent e7f5bbb9b8
commit 50be0270dc
4 changed files with 1319 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1281
.obsidian/plugins/obsidian-completr/scanned_words.txt vendored
View File

File diff suppressed because it is too large Load Diff

87
.obsidian/workspace.json vendored
View File

@@ -4,70 +4,49 @@
"type": "split",
"children": [
{
"id": "08ad9b53ade42d31",
"id": "3cd0f756afc6dabe",
"type": "tabs",
"dimension": 50.57833859095688,
"children": [
{
"id": "e2194e3299515374",
"id": "a9a4f2c88ccd5c11",
"type": "leaf",
"state": {
"type": "markdown",
"state": {
"file": "CCN/Ex01/Exercise 1.md",
"file": "Algorithmen und Datenstrukturen/UEB03/UEB03.md",
"mode": "source",
"source": false
}
}
}
]
},
{
"id": "47553fa673bb1eb6",
"type": "tabs",
"children": [
{
"id": "74c6cae00572ddcd",
"type": "leaf",
"state": {
"type": "pdf",
"state": {
"file": "Algorithmen und Datenstrukturen/UEB03/VL03-Listen.pdf"
}
}
},
{
"id": "e375859f90230dd6",
"type": "leaf",
"state": {
"type": "empty",
"state": {}
"type": "pdf",
"state": {
"file": "Algorithmen und Datenstrukturen/UEB03/UEB03.pdf"
}
}
}
],
"currentTab": 1
},
{
"id": "47553fa673bb1eb6",
"type": "tabs",
"dimension": 49.42166140904311,
"children": [
{
"id": "7446620410a970a1",
"type": "leaf",
"state": {
"type": "pdf",
"state": {
"file": "CCN/Ex01/CCN-1 - introduction.pdf"
}
}
},
{
"id": "61a2c54b2f74b659",
"type": "leaf",
"state": {
"type": "pdf",
"state": {
"file": "CCN/Ex01/ccn1-exercise1.pdf"
}
}
},
{
"id": "8d4452a52cce6015",
"type": "leaf",
"state": {
"type": "pdf",
"state": {
"file": "Informationssicherheit/VL/03-fm-orga-handout.pdf"
}
}
}
],
"currentTab": 2
}
],
"direction": "vertical"
@@ -133,6 +112,7 @@
"state": {
"type": "backlink",
"state": {
"file": "Algorithmen und Datenstrukturen/UEB03/UEB03.md",
"collapseAll": false,
"extraContext": false,
"sortOrder": "alphabetical",
@@ -149,6 +129,7 @@
"state": {
"type": "outgoing-link",
"state": {
"file": "Algorithmen und Datenstrukturen/UEB03/UEB03.md",
"linksCollapsed": false,
"unlinkedCollapsed": true
}
@@ -170,7 +151,9 @@
"type": "leaf",
"state": {
"type": "outline",
"state": {}
"state": {
"file": "Algorithmen und Datenstrukturen/UEB03/UEB03.md"
}
}
},
{
@@ -229,10 +212,14 @@
"juggl:Juggl global graph": false
}
},
"active": "e375859f90230dd6",
"active": "a9a4f2c88ccd5c11",
"lastOpenFiles": [
"Informationssicherheit/VL/03-fm-orga-handout.pdf",
"Algorithmen und Datenstrukturen/UEB03/UEB03.pdf",
"Algorithmen und Datenstrukturen/UEB03/UEB03.md",
"CCN/Ex01/Exercise 1.md",
"Algorithmen und Datenstrukturen/UEB03/VL03-Listen.pdf",
"Algorithmen und Datenstrukturen/UEB01",
"Informationssicherheit/VL/03-fm-orga-handout.pdf",
"CCN/Ex01/ccn1-exercise1.pdf",
"CCN/Ex01/2023-04-18_11-08.png",
"CCN/Ex01/CCN-1 - introduction.pdf",
@@ -253,7 +240,6 @@
"FH/Informationssicherheit/Ueb2/test.md",
"Informationssicherheit/Ueb2/test2.md",
"Informationssicherheit/Ueb2/Untitled.md",
"Informationssicherheit/Ueb1/01-ueb_uebungsblatt.pdf",
"Informationssicherheit/Ueb1/20230330_19h30m31s_grim.png",
"Informationssicherheit/Ueb1/20230330_19h34m13s_grim.png",
"Informationssicherheit/Ueb1/20230331_07h21m13s_grim.png",
@@ -262,10 +248,7 @@
"Informationssicherheit/Ueb1/20230331_14h12m43s_grim.png",
"Informationssicherheit/Ueb1/20230331_16h17m48s_grim.png",
"Informationssicherheit/Ueb1/Ueb01.md",
"Informationssicherheit/Ueb1/Ueb01.pdf",
"Informationssicherheit/VL/01-orga-motivation-handout.pdf",
"Informationssicherheit/VL/02-terminologie-handout.pdf",
"Algorithmen und Datenstrukturen/UEB01.md",
"Algorithmen und Datenstrukturen/UEB01/UEB01.md",
"2023-04-16.md",
"FH/2023-04-16.md",
"FH/Informationssicherheit/Ueb1/Ueb01.md",

0
Algorithmen und Datenstrukturen/UEB01.md → Algorithmen und Datenstrukturen/UEB01/UEB01.md
View File

3
Algorithmen und Datenstrukturen/UEB03/UEB03.md Normal file
View File

@@ -0,0 +1,3 @@
```
Link mittleresElement = new Link()
```