Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
07/22/10 00:44:01 (14 years ago)
Author:
swagner
Message:

Sorted usings and removed unused usings in entire solution (#1094)

File:
1 edited

Legend:

Unmodified
Added
Removed

  • trunk/sources/HeuristicLab.ExtLibs/HeuristicLab.Netron/3.0.2672.12446/Netron.Diagramming.Core-3.0.2672.12446/Analysis/INode.cs

    r2768 r4068  
    11using System;
    22using System.Drawing;
    3 using System.Collections.Generic;
    4 using System.Text;
    53
    6 namespace Netron.Diagramming.Core.Analysis
    7 {
     4namespace Netron.Diagramming.Core.Analysis {
     5  /// <summary>
     6  /// This interface describes the <see cref="IShape"/> from the point of view of graph analysis.
     7  /// </summary>
     8  public interface INode {
    89    /// <summary>
    9     /// This interface describes the <see cref="IShape"/> from the point of view of graph analysis.
     10    /// Get the in-degree of the node, the number of edges for which this node
     11    /// is the target.
    1012    /// </summary>
    11     public interface INode
    12     {
    13         /// <summary>
    14         /// Get the in-degree of the node, the number of edges for which this node
    15         /// is the target.
    16         /// </summary>
    17         int InDegree { get;}
    18         /// <summary>
    19         /// Get the out-degree of the node, the number of edges for which this node
    20         /// is the source.
    21         /// </summary>
    22         int OutDegree { get;}
    23         /// <summary>
    24         /// Get the degree of the node, the number of edges for which this node
    25         /// is either the source or the target.
    26         /// </summary>
    27         int Degree { get;}
    28         /// <summary>
    29         /// Gets the collection of all incoming edges, those for which this node
    30         /// is the target.
    31         /// </summary>
    32         CollectionBase<IEdge> InEdges { get;}
    33         /// <summary>
    34         /// Gets or sets whether this shape is fixed with respect to diagram layout
    35         /// </summary>           
    36         bool IsFixed { get; set;}
    37         /// <summary>
    38         /// Gets or sets a value indicating whether this instance is expanded.
    39         /// </summary>
    40         /// <value>
    41         ///   <c>true</c> if this instance is expanded; otherwise, <c>false</c>.
    42         /// </value>
    43         bool IsExpanded { get; set;}
    44         /// <summary>
    45         /// Gets the unique identifier of this node.
    46         /// </summary>
    47         /// <value>The uid.</value>
    48         Guid Uid { get;}
    49         /// <summary>
    50         /// Gets the collection of all outgoing edges, those for which this node
    51         /// is the source.
    52         /// </summary>
    53         CollectionBase<IEdge> OutEdges { get;}
    54         /// <summary>
    55         ///Gets the collection of all incident edges, those for which this node
    56         /// is either the source or the target.
    57         /// </summary>
    58         CollectionBase<IEdge> Edges { get;}
    59         /// <summary>
    60         /// Gets the collection of all adjacent nodes connected to this node by an
    61         /// incoming edge (i.e., all nodes that "point" at this one).
    62         /// </summary>
    63         CollectionBase<INode> InNeighbors { get;}
    64         /// <summary>
    65         /// Gets the collection of adjacent nodes connected to this node by an
    66         /// outgoing edge (i.e., all nodes "pointed" to by this one).
    67         /// </summary>
    68         CollectionBase<INode> OutNeighbors { get;}
     13    int InDegree { get; }
     14    /// <summary>
     15    /// Get the out-degree of the node, the number of edges for which this node
     16    /// is the source.
     17    /// </summary>
     18    int OutDegree { get; }
     19    /// <summary>
     20    /// Get the degree of the node, the number of edges for which this node
     21    /// is either the source or the target.
     22    /// </summary>
     23    int Degree { get; }
     24    /// <summary>
     25    /// Gets the collection of all incoming edges, those for which this node
     26    /// is the target.
     27    /// </summary>
     28    CollectionBase<IEdge> InEdges { get; }
     29    /// <summary>
     30    /// Gets or sets whether this shape is fixed with respect to diagram layout
     31    /// </summary>           
     32    bool IsFixed { get; set; }
     33    /// <summary>
     34    /// Gets or sets a value indicating whether this instance is expanded.
     35    /// </summary>
     36    /// <value>
     37    ///   <c>true</c> if this instance is expanded; otherwise, <c>false</c>.
     38    /// </value>
     39    bool IsExpanded { get; set; }
     40    /// <summary>
     41    /// Gets the unique identifier of this node.
     42    /// </summary>
     43    /// <value>The uid.</value>
     44    Guid Uid { get; }
     45    /// <summary>
     46    /// Gets the collection of all outgoing edges, those for which this node
     47    /// is the source.
     48    /// </summary>
     49    CollectionBase<IEdge> OutEdges { get; }
     50    /// <summary>
     51    ///Gets the collection of all incident edges, those for which this node
     52    /// is either the source or the target.
     53    /// </summary>
     54    CollectionBase<IEdge> Edges { get; }
     55    /// <summary>
     56    /// Gets the collection of all adjacent nodes connected to this node by an
     57    /// incoming edge (i.e., all nodes that "point" at this one).
     58    /// </summary>
     59    CollectionBase<INode> InNeighbors { get; }
     60    /// <summary>
     61    /// Gets the collection of adjacent nodes connected to this node by an
     62    /// outgoing edge (i.e., all nodes "pointed" to by this one).
     63    /// </summary>
     64    CollectionBase<INode> OutNeighbors { get; }
    6965
    70         /// <summary>
    71         /// Get an iterator over all nodes connected to this node.
    72         /// </summary>
    73         CollectionBase<INode> Neighbors { get;}
     66    /// <summary>
     67    /// Get an iterator over all nodes connected to this node.
     68    /// </summary>
     69    CollectionBase<INode> Neighbors { get; }
    7470
    75         /// <summary>
    76         /// Get the parent node of this node in a tree structure.
    77         /// </summary>
    78         INode ParentNode { get; set;}
    79         /// <summary>
    80         /// Get the edge between this node and its parent node in a tree
    81         /// structure.
    82         /// </summary>
    83         IEdge ParentEdge { get; set;}
    84         /// <summary>
    85         /// Get the tree depth of this node.
    86         ///<remarks>The root's tree depth is
    87         /// zero, and each level of the tree is one depth level greater.
    88         /// </remarks>
    89         /// </summary>
    90         int Depth { get; set;}
    91         /// <summary>
    92         /// Get the number of tree children of this node.
    93         /// </summary>
    94         int ChildCount { get;}
    95         /// <summary>
    96         /// Get this node's first tree child.
    97         /// </summary>
    98         INode FirstChild { get;}
    99         /// <summary>
    100         /// Get this node's last tree child.
    101         /// </summary>
    102         INode LastChild { get;}
     71    /// <summary>
     72    /// Get the parent node of this node in a tree structure.
     73    /// </summary>
     74    INode ParentNode { get; set; }
     75    /// <summary>
     76    /// Get the edge between this node and its parent node in a tree
     77    /// structure.
     78    /// </summary>
     79    IEdge ParentEdge { get; set; }
     80    /// <summary>
     81    /// Get the tree depth of this node.
     82    ///<remarks>The root's tree depth is
     83    /// zero, and each level of the tree is one depth level greater.
     84    /// </remarks>
     85    /// </summary>
     86    int Depth { get; set; }
     87    /// <summary>
     88    /// Get the number of tree children of this node.
     89    /// </summary>
     90    int ChildCount { get; }
     91    /// <summary>
     92    /// Get this node's first tree child.
     93    /// </summary>
     94    INode FirstChild { get; }
     95    /// <summary>
     96    /// Get this node's last tree child.
     97    /// </summary>
     98    INode LastChild { get; }
    10399
    104         /// <summary>
    105         /// Gets the X coordinate.
    106         /// </summary>
    107         /// <value>The X.</value>
    108         int X { get;}
    109         /// <summary>
    110         /// Gets the Y coordinate.
    111         /// </summary>
    112         /// <value>The Y.</value>
    113         int Y { get;}
     100    /// <summary>
     101    /// Gets the X coordinate.
     102    /// </summary>
     103    /// <value>The X.</value>
     104    int X { get; }
     105    /// <summary>
     106    /// Gets the Y coordinate.
     107    /// </summary>
     108    /// <value>The Y.</value>
     109    int Y { get; }
    114110
    115         /// <summary>
    116         /// Get this node's previous tree sibling.
    117         /// </summary>
    118         INode PreviousSibling { get;}
    119          /// <summary>
    120         /// Get this node's next tree sibling.
    121          /// </summary>
    122         INode NextSibling { get;}
     111    /// <summary>
     112    /// Get this node's previous tree sibling.
     113    /// </summary>
     114    INode PreviousSibling { get; }
     115    /// <summary>
     116    /// Get this node's next tree sibling.
     117    /// </summary>
     118    INode NextSibling { get; }
    123119
    124         /// <summary>
    125         /// Gets the rectangle.
    126         /// </summary>
    127         /// <value>The rectangle.</value>
    128         Rectangle Rectangle { get;}
    129         /// <summary>
    130         /// Get an iterator over this node's tree children.
    131         /// </summary>
    132         CollectionBase<INode> Children { get; set;}
    133         /// <summary>
    134         /// Get an iterator over the edges from this node to its tree children.
    135         /// </summary>
    136         CollectionBase<IEdge> ChildEdges { get;}
     120    /// <summary>
     121    /// Gets the rectangle.
     122    /// </summary>
     123    /// <value>The rectangle.</value>
     124    Rectangle Rectangle { get; }
     125    /// <summary>
     126    /// Get an iterator over this node's tree children.
     127    /// </summary>
     128    CollectionBase<INode> Children { get; set; }
     129    /// <summary>
     130    /// Get an iterator over the edges from this node to its tree children.
     131    /// </summary>
     132    CollectionBase<IEdge> ChildEdges { get; }
    137133
    138         /// <summary>
    139         /// Moves the node, the argument being the motion vector.
    140         /// </summary>
    141         /// <param name="p">The p.</param>
    142         void MoveBy(Point p);
    143     }
    144  
    145    
    146  
    147  
     134    /// <summary>
     135    /// Moves the node, the argument being the motion vector.
     136    /// </summary>
     137    /// <param name="p">The p.</param>
     138    void MoveBy(Point p);
     139  }
     140
     141
     142
     143
    148144}
Note: See TracChangeset for help on using the changeset viewer.