| <!DOCTYPE html> | |
| <meta charset="utf-8"> | |
| <style> | |
| body { | |
| font: 1em sans-serif; | |
| } | |
| .chord path { | |
| fill-opacity: .67; |
| GENERATED_FILES = \ | |
| capecod.json | |
| all: $(GENERATED_FILES) | |
| .PHONY: clean all | |
| clean: | |
| rm -rf -- $(GENERATED_FILES) build |
| <html> | |
| <head> | |
| <script src="//code.jquery.com/jquery-1.11.3.min.js"></script> | |
| <script src="//code.jquery.com/jquery-migrate-1.2.1.min.js"></script> | |
| <script src="https://cdnjs.cloudflare.com/ajax/libs/d3/3.5.5/d3.min.js" charset="utf-8"></script> | |
| </head> | |
| <style> | |
| body { | |
| font: 10px sans-serif; |
Suppose you want to fly from Honolulu to JFK. What path should you take?
Navigators use something called a Great Circle, which is defined as the shortest path connecting two points on the surface of the Earth. The Great Circle connecting Honolulu and JFK is shown in blue above.
There is another path you can take called a loxodrome (or
| function cubic_driver(num_points) | |
| % cubic_driver(n) computes a cubic spline | |
| % interpolant of the runge function | |
| % | |
| % f(x) = 1/(1+25*x^2) | |
| % | |
| % based on n linearly spaced | |
| % points in the interval [-1,1] | |
| runge = @(x) 1./(1+ 25*x.^2); |
| function [numcycles,cycles] = find_elem_circuits(A) | |
| if ~issparse(A) | |
| A = sparse(A); | |
| end | |
| n = size(A,1); | |
| Blist = cell(n,1); |
| function [B,compindex,ci]=condense(A) | |
| % CONDENSE Construct the condensed graph of A | |
| % | |
| % [B,compindex,ci] = condense(A) returns the | |
| % condensed graph of A. | |
| % | |
| % Example: | |
| % A = zeros(5,5); | |
| % A(1,2) = 1; A(2,3) = 1; A(3,4) = 1; A(4,2) = 1; A(4,5) = 1; | |
| % [B,compindex] = condense(A) |