cycle

I have a slideshow built in flash that I want to mimic in jQuery. The slide show uses the images from the slideshow as the pager numbers. The problem im having is once i apply links to the slideshow images the pagerAnchorBuilder image returns an undefined for the src of the image. Javascript - $(function() { $('#slideshow').before('<ul id="nav">').cycle({ fx: 'fade', timeout: 7000, pager: '#nav', pagerAnchorBuilder: function(idx, slide) { return '<li><a href="#"><img src="' + slide.src + '" width="100" height="60" /></a></li>'; } }); }); HTML - <div id="slideshow" class="pics"> <a href="http:/

Does anyone know the Donald B. Johnson's algorithm , which enumerates all the elementary circuits (cycles) in a directed graph? I have the paper he had published in 1975, but I cannot understand the pseudocode. My goal is to implement this algorithm in Java. Some questions I have, for example, is what is the matrix A k it refers to. In the pseudocode, it mentions that Ak:=adjacency structure of strong component K with least vertex in subgraph of G induced by {s,s+1,....n}; Does that mean I have to implement another algorithm that finds the A k matrix? Another question is what the following

In Haskell, some lists are cyclic: ones = 1 : ones Others are not: nums = [1..] And then there are things like this: more_ones = f 1 where f x = x : f x This denotes the same value as ones , and certainly that value is a repeating sequence. But whether it's represented in memory as a cyclic data structure is doubtful. (An implementation could do so, but this answer explains that "it's unlikely that this will happen in practice" .) Suppose we take a Haskell implementation and hack into it a built-in function isCycle :: [a] -> Bool that examines the structure of the in-memory representation of

In relational database design, should one worry about one (or more) "cyclic graphs" posing problems? (Simplified) E.g., tables T1( T1_Id , ...) T2( T2_Id , T1_Id_Fk, ...) T3( T1_Id_Fk, T2_Id_Fk , ..) Primary keys are bolded. Rows in T1 have a double role. A T1 row r1 can be in relationship T3 with a row r2 in T2, but it can also be a parent row for a (possibly the same) row r2' in T2. These two relationships are orthogonal. I came up with something like this: T1_Base( T1_Id , ...) T1_Child1( T1_C1_Id , ...) T1_Child2( T1_C2_Id , ...) T2( T2_Id , T1_C1_Id_Fk, ...) T3( T1_C2_Id_Fk, T2_Id_Fk , ..