From 2658ca84e4a0b847ee705e0aee393ef88eba10ee Mon Sep 17 00:00:00 2001
From: Yigit Sever
Date: Sun, 15 Nov 2020 04:25:19 +0300
Subject: rename mylib for better latex

---
 my_lib.bib | 12 ------------
 mylib.bib  | 11 +++++++++++
 2 files changed, 11 insertions(+), 12 deletions(-)
 delete mode 100644 my_lib.bib
 create mode 100644 mylib.bib

diff --git a/my_lib.bib b/my_lib.bib
deleted file mode 100644
index 4a7e4ae..0000000
--- a/my_lib.bib
+++ /dev/null
@@ -1,12 +0,0 @@
-
-@article{tarjanDepthFirst1972,
-  title = {Depth-{{First Search}} and {{Linear Graph Algorithms}}},
-  author = {Tarjan, R.},
-  date = {1972},
-  journaltitle = {SIAM J. Comput.},
-  doi = {10.1137/0201010},
-  abstract = {The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and at algorithm for finding the biconnected components of an undirect graph are presented. The space and time requirements of both algorithms are bounded by \$k\_1 V + k\_2 E + k\_3 \$ for some constants \$k\_1 ,k\_2 \$, and \$k\_3 \$, where V is the number of vertices and E is the number of edges of the graph being examined.},
-  file = {/home/yigit/.local/share/zotero/storage/XGDJGERQ/tarjan_1972_depth-first_search_and_linear_graph.pdf}
-}
-
-
diff --git a/mylib.bib b/mylib.bib
new file mode 100644
index 0000000..dd6c092
--- /dev/null
+++ b/mylib.bib
@@ -0,0 +1,11 @@
+@article{tarjanDepthFirst1972,
+  title = {Depth-{{First Search}} and {{Linear Graph Algorithms}}},
+  author = {Tarjan, R.},
+  date = {1972},
+  journaltitle = {SIAM J. Comput.},
+  doi = {10.1137/0201010},
+  abstract = {The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and at algorithm for finding the biconnected components of an undirect graph are presented. The space and time requirements of both algorithms are bounded by \$k\_1 V + k\_2 E + k\_3 \$ for some constants \$k\_1 ,k\_2 \$, and \$k\_3 \$, where V is the number of vertices and E is the number of edges of the graph being examined.},
+  file = {/home/yigit/.local/share/zotero/storage/XGDJGERQ/tarjan_1972_depth-first_search_and_linear_graph.pdf}
+}
+
+
-- 
cgit v1.2.3-70-g09d2