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/IGraph.cs

    r2768 r4068  
    1 using System;
    2 using System.Collections.Generic;
    3 using System.Text;
    41
    5 namespace Netron.Diagramming.Core.Analysis
    6 {
     2namespace Netron.Diagramming.Core.Analysis {
     3  /// <summary>
     4  /// This interface describes the <see cref="Model"/> from the point of view of graph analysis.
     5  /// </summary>
     6  public interface IGraph {
    77    /// <summary>
    8     /// This interface describes the <see cref="Model"/> from the point of view of graph analysis.
     8    /// Get the in-degree of a node, the number of edges for which the node
     9    /// is the target.
    910    /// </summary>
    10     public interface IGraph
    11     {
    12         /// <summary>
    13         /// Get the in-degree of a node, the number of edges for which the node
    14         /// is the target.
    15         /// </summary>
    16         /// <param name="node"></param>
    17         /// <returns></returns>
    18         int InDegree(INode node);
    19         /// <summary>
    20         /// Get the out-degree of a node, the number of edges for which the node
    21         /// is the source.
    22         /// </summary>
    23         /// <param name="node"></param>
    24         /// <returns></returns>
    25         int OutDegree(INode node);
    26         /// <summary>
    27         /// Get the degree of a node, the number of edges for which a node
    28         /// is either the source or the target.
    29         /// </summary>
    30         /// <param name="node"></param>
    31         /// <returns></returns>
    32         int Degree(INode node);
    33         /// <summary>
    34         /// Indicates if the edges of this graph are directed or undirected.
    35         /// </summary>
    36         bool IsDirected { get;}
    37         /// <summary>
    38         /// Returns the nodes for the current page. This is the same as the <see cref="Model.Shapes"/> property except that the return type is
    39         /// here <see cref="INode"/> rather than <see cref="IShape"/> type.
    40         /// </summary>
    41         CollectionBase<INode> Nodes { get;}
    42         /// <summary>
    43         /// Get the source Node for the given Edge instance.
    44         /// </summary>
    45         /// <param name="edge"></param>
    46         /// <returns></returns>
    47         INode FromNode(IEdge edge);
    48         /// <summary>
    49         /// Get the target Node for the given Edge instance.
    50         /// </summary>
    51         /// <param name="edge"></param>
    52         /// <returns></returns>
    53         INode ToNode(IEdge edge);
    54         /// <summary>
    55         ///  Given an Edge and an incident Node, return the other Node
    56         /// connected to the edge.
    57         /// </summary>
    58         /// <param name="edge"></param>
    59         /// <param name="node"></param>
    60         /// <returns></returns>
    61         INode AdjacentNode(IEdge edge, INode node);
    62         /// <summary>
    63         /// Gets the collection of all adjacent nodes connected to the given node by an
    64         /// incoming edge (i.e., all nodes that "point" at this one).
    65         /// </summary>
    66         CollectionBase<INode> InNeighbors(INode node);
    67         /// <summary>
    68         /// Gets the collection of adjacent nodes connected to the given node by an
    69         /// outgoing edge (i.e., all nodes "pointed" to by this one).
    70         /// </summary>
    71         CollectionBase<INode> OutNeighbors(INode node);
     11    /// <param name="node"></param>
     12    /// <returns></returns>
     13    int InDegree(INode node);
     14    /// <summary>
     15    /// Get the out-degree of a node, the number of edges for which the node
     16    /// is the source.
     17    /// </summary>
     18    /// <param name="node"></param>
     19    /// <returns></returns>
     20    int OutDegree(INode node);
     21    /// <summary>
     22    /// Get the degree of a node, the number of edges for which a node
     23    /// is either the source or the target.
     24    /// </summary>
     25    /// <param name="node"></param>
     26    /// <returns></returns>
     27    int Degree(INode node);
     28    /// <summary>
     29    /// Indicates if the edges of this graph are directed or undirected.
     30    /// </summary>
     31    bool IsDirected { get; }
     32    /// <summary>
     33    /// Returns the nodes for the current page. This is the same as the <see cref="Model.Shapes"/> property except that the return type is
     34    /// here <see cref="INode"/> rather than <see cref="IShape"/> type.
     35    /// </summary>
     36    CollectionBase<INode> Nodes { get; }
     37    /// <summary>
     38    /// Get the source Node for the given Edge instance.
     39    /// </summary>
     40    /// <param name="edge"></param>
     41    /// <returns></returns>
     42    INode FromNode(IEdge edge);
     43    /// <summary>
     44    /// Get the target Node for the given Edge instance.
     45    /// </summary>
     46    /// <param name="edge"></param>
     47    /// <returns></returns>
     48    INode ToNode(IEdge edge);
     49    /// <summary>
     50    ///  Given an Edge and an incident Node, return the other Node
     51    /// connected to the edge.
     52    /// </summary>
     53    /// <param name="edge"></param>
     54    /// <param name="node"></param>
     55    /// <returns></returns>
     56    INode AdjacentNode(IEdge edge, INode node);
     57    /// <summary>
     58    /// Gets the collection of all adjacent nodes connected to the given node by an
     59    /// incoming edge (i.e., all nodes that "point" at this one).
     60    /// </summary>
     61    CollectionBase<INode> InNeighbors(INode node);
     62    /// <summary>
     63    /// Gets the collection of adjacent nodes connected to the given node by an
     64    /// outgoing edge (i.e., all nodes "pointed" to by this one).
     65    /// </summary>
     66    CollectionBase<INode> OutNeighbors(INode node);
    7267
    73         /// <summary>
    74         /// Get an iterator over all nodes connected to the given node.
    75         /// </summary>
    76         CollectionBase<INode> Neighbors(INode node);
    77         /// <summary>
    78         /// Gets the edges.
    79         /// </summary>
    80         /// <value>The edges.</value>
    81         CollectionBase<IEdge> Edges { get;}
    82         /// <summary>
    83         /// Returns the edges connected to the given node.
    84         /// </summary>
    85         /// <param name="node">The node.</param>
    86         /// <returns></returns>
    87         CollectionBase<IEdge> EdgesOf(INode node);
     68    /// <summary>
     69    /// Get an iterator over all nodes connected to the given node.
     70    /// </summary>
     71    CollectionBase<INode> Neighbors(INode node);
     72    /// <summary>
     73    /// Gets the edges.
     74    /// </summary>
     75    /// <value>The edges.</value>
     76    CollectionBase<IEdge> Edges { get; }
     77    /// <summary>
     78    /// Returns the edges connected to the given node.
     79    /// </summary>
     80    /// <param name="node">The node.</param>
     81    /// <returns></returns>
     82    CollectionBase<IEdge> EdgesOf(INode node);
    8883
    89         /// <summary>
    90         /// Returns the incoming edges of the given node.
    91         /// </summary>
    92         /// <param name="node">The node.</param>
    93         /// <returns></returns>
    94         CollectionBase<IEdge> InEdges(INode node);
     84    /// <summary>
     85    /// Returns the incoming edges of the given node.
     86    /// </summary>
     87    /// <param name="node">The node.</param>
     88    /// <returns></returns>
     89    CollectionBase<IEdge> InEdges(INode node);
    9590
    96         /// <summary>
    97         /// Returns the outgoing edges attached to the given node.
    98         /// </summary>
    99         /// <param name="node">The node.</param>
    100         /// <returns></returns>
    101         CollectionBase<IEdge> OutEdges(INode node);
     91    /// <summary>
     92    /// Returns the outgoing edges attached to the given node.
     93    /// </summary>
     94    /// <param name="node">The node.</param>
     95    /// <returns></returns>
     96    CollectionBase<IEdge> OutEdges(INode node);
    10297
    103         /// <summary>
    104         /// Gets a spanning tree of the model or graph.
    105         /// </summary>
    106         /// <value>The spanning tree.</value>
    107         ITree SpanningTree { get;}
     98    /// <summary>
     99    /// Gets a spanning tree of the model or graph.
     100    /// </summary>
     101    /// <value>The spanning tree.</value>
     102    ITree SpanningTree { get; }
    108103
    109         /// <summary>
    110         /// Makes the spanning tree.
    111         /// </summary>
    112         /// <param name="node">The node.</param>
    113         void MakeSpanningTree(INode node);
     104    /// <summary>
     105    /// Makes the spanning tree.
     106    /// </summary>
     107    /// <param name="node">The node.</param>
     108    void MakeSpanningTree(INode node);
    114109
    115         /// <summary>
    116         /// Clears the spanning tree.
    117         /// </summary>
    118         void ClearSpanningTree();
     110    /// <summary>
     111    /// Clears the spanning tree.
     112    /// </summary>
     113    void ClearSpanningTree();
    119114
    120115
     
    124119
    125120
    126     }
     121  }
    127122}
Note: See TracChangeset for help on using the changeset viewer.