Plotting using a CSV file
This should get you started: set datafile separator “,” plot ‘infile’ using 0:1
graph
Graphs data structure: DFS vs BFS? [closed]
BFS is going to use more memory depending on the branching factor… however, BFS is a complete algorithm… meaning if you are using it to search for something in the lowest depth possible, BFS will give you the optimal solution. BFS space complexity is O(b^d)… the branching factor raised to the depth (can be A … Read more
Difference between hamiltonian path and euler path
An Euler path is a path that passes through every edge exactly once. If it ends at the initial vertex then it is an Euler cycle. A Hamiltonian path is a path that passes through every vertex exactly once (NOT every edge). If it ends at the initial vertex then it is a Hamiltonian cycle. … Read more
Cycles in an Undirected Graph
I think that depth first search solves it. If an unexplored edge leads to a node visited before, then the graph contains a cycle. This condition also makes it O(n), since you can explore maximum n edges without setting it to true or being left with no unexplored edges.
Millions of 3D points: How to find the 10 of them closest to a given point?
Million points is a small number. The most straightforward approach works here (code based on KDTree is slower (for querying only one point)). Brute-force approach (time ~1 second) #!/usr/bin/env python import numpy NDIM = 3 # number of dimensions # read points into array a = numpy.fromfile(‘million_3D_points.txt’, sep=’ ‘) a.shape = a.size / NDIM, NDIM … Read more
Algorithm for “nice” grid line intervals on a graph
I’ve done this with kind of a brute force method. First, figure out the maximum number of tick marks you can fit into the space. Divide the total range of values by the number of ticks; this is the minimum spacing of the tick. Now calculate the floor of the logarithm base 10 to get … Read more
Graph auto-layout algorithm
You will find http://graphdrawing.org/ and this tutorial, by Roberto Tamassia, professor at Brown University, quite helpful. I like a lot Force-Directed Techniques (pp. 66-72 in the tutorial) like the Spring Embedder. You assume there is a spring or other force between any two adjacent nodes and let nature (simulation) do the work 🙂
Difference and advantages between dijkstra & A star [duplicate]
It says A* is faster than using dijkstra and uses best-first-search to speed things up. A* is basically an informed variation of Dijkstra. A* is considered a “best first search” because it greedily chooses which vertex to explore next, according to the value of f(v) [f(v) = h(v) + g(v)] – where h is the … Read more
Common main title of a figure panel compiled with par(mfrow)
This should work, but you’ll need to play around with the line argument to get it just right: par(mfrow = c(2, 2)) plot(iris$Petal.Length, iris$Petal.Width) plot(iris$Sepal.Length, iris$Petal.Width) plot(iris$Sepal.Width, iris$Petal.Width) plot(iris$Sepal.Length, iris$Petal.Width) mtext(“My ‘Title’ in a strange place”, side = 3, line = -21, outer = TRUE) mtext stands for “margin text”. side = 3 says to … Read more
Is there any ‘out-of-the-box’ 2D/3D plotting library for C++? [closed]
Even though this thread is old but gold. QCustomPlot is very recommendable as well to complement this list.