segment_class Module Reference
Data Types | |
type | edge_type |
type | segment_type |
Functions/Subroutines | |
integer function | countfree (n, edgelist) |
subroutine | order_edge (e) |
subroutine | edge_print (ee) |
subroutine | set_neighbors (n, elist) |
recursive subroutine | leftney (n, elist, istart) |
recursive subroutine | rightney (n, elist, istart) |
Function/Subroutine Documentation
integer function segment_class::countfree | ( | integer, intent(in) | n, |
type(edge_type), dimension(n), intent(in) | edgelist | ||
) |
subroutine segment_class::edge_print | ( | type(edge_type), intent(in) | ee | ) |
recursive subroutine segment_class::leftney | ( | integer, intent(in) | n, |
type(edge_type), dimension(n), intent(inout) | elist, | ||
integer, intent(in) | istart | ||
) |
Here is the caller graph for this function:

subroutine segment_class::order_edge | ( | type(edge_type), intent(inout) | e | ) |
Here is the caller graph for this function:

recursive subroutine segment_class::rightney | ( | integer, intent(in) | n, |
type(edge_type), dimension(n), intent(inout) | elist, | ||
integer, intent(in) | istart | ||
) |
Here is the caller graph for this function:

subroutine segment_class::set_neighbors | ( | integer, intent(in) | n, |
type(edge_type), dimension(n), intent(inout) | elist | ||
) |
Here is the call graph for this function:

Here is the caller graph for this function:
