Git commit 8dce474539b288f71efd681c86bcf52890cece27 by Burkhard L?ck. Committed on 24/02/2013 at 11:36. Pushed by lueck into branch 'master'.
remove consecutive duplicate word >to< M +1 -1 doc/index.docbook http://commits.kde.org/rocs/8dce474539b288f71efd681c86bcf52890cece27 diff --git a/doc/index.docbook b/doc/index.docbook index 3f82cac..590def3 100644 --- a/doc/index.docbook +++ b/doc/index.docbook @@ -655,7 +655,7 @@ Given a data structure object of type "Graph", you can call the following member array input_edges(); // list of input edges array output_edges(); // list of all output edges array loop_edges(); // list of all edges looping to the node - array connected_edges(node target); // all edges that connect this to to node 'target' + array connected_edges(node target); // all edges that connect this node with node 'target' </programlisting> </sect3>
