Can somebody tell me a some simple algorithm to find closed path containing the origin?
927748
You first define an array NodesList with index 0 as origin (C standard) containing all your nodes. The variable NodesNumber is the number of nodes. The key element is to define the operators S (for successor) and P (for predecessor) that will make the array behave as a circular list.\nS(NodesList[ i ]) = NodesList[ i + 1] if i < NodesNumber - 2\nand for the last node\nS(NodesList[ NodesNumber - 1 ]) = NodesList[ 0 ] \nSimilarly for P\nP(NodesList[ i ]) = NodesList[ i - 1] if i > 0\nand for the first node (origin)\nP(NodesList[ 0 ]) = NodesList[  NodesNumber - 1 ] \nThe algorithm has 2 parts\n// forward\nStartNode := NodesList[ NodesNumber - N  ]\nfor I := 1 to N\n  begin\n     StartNode := S(StartNode);\n     Node := StartNode;\n     Path := StartNode;\n     for J := 1 to N - 1\n        begin\n           Node := S(Node);\n           Add Node to Path \n        end \n      Record Path\n  end;\n// backward\nStartNode := NodesList[ N  ]\nfor I := 1 to N\n  begin\n     StartNode := P(StartNode);\n     Node := StartNode;\n     Path := StartNode;\n     for J := 1 to N - 1\n        begin\n           Node := P(Node);\n           Add Node to Path \n        end \n      Record Path\n  end;\nIn the second part the starting point is changed and S() are changed by P()
405740
Use the way back engine from http://web.archive.org and use the archived link from there
387286
Karnaugh map:\n\nCheck out the following link which will help.
973
u spelt it wrong :-(\nit should have been Dijikstra\n\nSTDMETHODIMP CDijkstra::ShortestPath(long node1, long node2)\n{\n    ReleaseGraph();\n    // init d and pi\n    InitializeSource(g, g.m_nodes[node1-1]);\n    // Set S empty\n    VTYPE_NODE S;\n    // Put nodes in Q\n    VTYPE_NODE Q;\n    VTYPE_NODE::iterator kl;\n    for(kl=g.m_nodes.begin(); kl<g.m_nodes.end(); kl++)\n    {\n        CNode node = (*kl).Copy();\n        Q.push_back(node);\n    }\n    // Algorithm\n    while(Q.size())\n    {\n        CNode nod = ExtractMin(Q); // the minim value \n                // for the shortest path up to this step\n        S.push_back(nod);\n        // each vertex v which is a neighbour of u\n        VTYPE_NODE::iterator kl;\n        for(kl=g.m_nodes.begin(); kl<g.m_nodes.end(); kl++)\n        {\n            if(ExistEdge(nod, (*kl)))\n            {\n                bool gasit = false;\n                VTYPE_NODE::iterator kll;\n                for(kll=Q.begin(); kll<Q.end(); kll++)\n                {\n                    if((*kll).m_NodeNr == (*kl).m_NodeNr)\n                    gasit = true;\n                }\n                if(gasit)\n                    Relax(nod, (*kl), GetEdgeVal(nod, (*kl)));\n            }\n        }\n    }\n    RefreshDone(node1, node2);\n    return S_OK;\n}
423788
look up y-tunnel on the top right hand of the page
894119
Well... the easiest and most general approach is to  traverse the tree in preorder depth-first manner, writing the nodes to the file, and inserting a special separator (a centinel) at the end of each branch - just before the traversal process is about to move up:\n\nvoid write_node (struct node *root, FILE *out)\n{\n    root ? fprintf (out, "%s&#92;n", node_to_string (root, buffer)) :\n    fprintf (out, "%c&#92;n", SENTINEL);\n}\n       \nvoid read_tree (struct node *root, FILE *out)\n{\n   write_node (root);\n    if (!root) return;     \n    save_tree (root->left, out);\n    save_tree (root->right, out);\n}\n\nthen you can read this structure back in  in the same order:\nstruct node* read_node (FILE *in)\n{\n    char buffer[1024];\n    if (!fgets(in, buffer, 1024) || buffer[0] == SENTINEL) return 0;\n   return parse_node (buffer);\n}\n    \nstruct node *read_tree (FILE *out)\n{\n    struct node *root = read_node (out);\n    if (!root) return 0;\n    root->left = read_tree (out);\n    root->right= read_tree(out);\n}
43874
you can go to "inset" then "symbol" and find it there. Or  alt - 0153
173713
Incidentally > Search...\n\nThe options are pretty self-explanatory and you can search for files of a certain type, modified with in a date or time range or over/under a certain size etc etc\n\nIncidently: "How can I find a file without knowing the exact path?"
24067
Enjoy:\nhttp://unmuseum.mus.pa.us/triangle.htm
669943
maybe try www.sasslost.com/locatelostpeople
379357
It is called "extention".\n\nSo, you need an extension list.\nOne of them (very wide) is attached. You can obtain there an alphabetically list of extensions as well as associated extentions with some program.
576269
google it exactly,\n\nI found\n\nXLMan
749366
use several search engines to find it\n\n:> peace\n.
561170
use the 'g' modifier. for example ~/^first.*last$/g
400503
since each one gives you a *-----* i would say all of them are line segments.\n\nHowever since D. is the only one with an indefinite beginning and end and not a possible end or beginning, i would definately have to go with \n\nD.) -5 <= x <= 5\n\nThat is the only one that has a defined beginning and end and not a undefined end and/or beginning.
805688
U can use either Kruskal's algorithm or prims algorithm. More information about these algorithm u can find on internet.\n\nPrims algorithm is based on adjacency matrix.
954003
it is from a logic work sheet.  directions are find the next item in the pattern.  examples:  12321, 23432, 34543, 45654\na, z, b, y, c, x, d\ntam, tan, rib, rid, rat, raw, hip