update readme

Author: YasInvolved

README.md

@@ -1,5 +1,15 @@
 # Digraph
+Simple program that lets you find paths of specified length in huge graphs.
+## Requirements
+- Linux or Windows
+- Processor capable of executing AVX2 instructions (most of modern processors support it, thus you shouldn't be concerned)
+
+> [!IMPORTANT]
+> Windows machines must have [Visual C++ Runtime](https://aka.ms/vc14/vc_redist.x64.exe) installed. 
+
 ## Usage
+> [!NOTE]
+> You might also drag and drop the description file onto the executable to run it.
 ### Windows
 ```
 digraph.exe {graph_path}
@@ -11,7 +21,7 @@ digraph.exe {graph_path}
 ```
 
 ## Graph Description JSON
-Writing your own JSON is quite simple. Take a look at [example1](/example_graphs/example1.json) or [example2](/example_graphs/example2.json).
+Writing your own JSON is quite simple. Please take a look at [example1](/example_graphs/example1.json) or [example2](/example_graphs/example2.json).
 
 ## Used Open Source Projects
 - [fmt](https://github.com/fmtlib/fmt) by Victor Zverovich and {fmt} contributors [MIT License]

src/main.cpp

@@ -72,7 +72,7 @@ class Digraph
 			float paths = walkMatrix.get(i, j);
 			if (paths > 0.0f)
 			{
-				fmt::print("There's a path of length {} from {} to {}\n", paths, static_cast<uint32_t>(length), m_ixToVert.at(i), m_ixToVert.at(j));
+				fmt::print("There's a path of length {} from {} to {}\n", static_cast<uint32_t>(length), m_ixToVert.at(i), m_ixToVert.at(j));
 				pathCount++;
 			}
 		}
@@ -230,7 +230,7 @@ int main(int argc, char** argv)
 	bool run = true;
 	while (run)
 	{
-		int choice = menu("Choose an action:\n\t1. Look for paths with specified lenght\n\t2. Check whether the graph is acyclic\n\t3. Exit\n\nChoice: ");
+		int choice = menu("Choose an action:\n\t1. Look for paths with specified length\n\t2. Check whether the graph is acyclic\n\t3. Exit\n\nChoice: ");
 
 		switch (choice)
 		{