#13301: Implement linear time algorithm to detect path intersection
---------------------------------+------------------------------------------
Reporter: lucaspastor | Owner: lucaspastor
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.3
Component: combinatorics | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by slabbe):
As of now, the node structure is:
{{{
#Node structure
cdef struct Node:
int node_number
int node_id
Node* parent
Node** children
Node** neighbors
int* coords
int visited
}}}
I believe it could be simplified. For example, I believe {{{node_id}}} is
unused by the important 4 functions. Also {{{node_number}}} and
{{{visited}}} are used by distinct functions. So, they could be merged
into one {{{int data}}} which could do both job.
Moreover, I thought the coords were not necessary inside the node as we
can find them from the data structure. Hence, a simplified node structure
could be :
{{{
#Node structure
cdef struct Node:
Node* parent
Node** children
Node** neighbors
int data
}}}
What do you think?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13301#comment:3>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
