IT:AD:NET:Libraries:QuickGraph:Concepts [Notes]

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.

# IT:AD:NET:Libraries:QuickGraph:Concepts #


<callout type="Navigation" class="small">

* [[../|(UP)]]
* See also:
    * [[IT/AD/QuickGraph/]]


</callout>


<panel title="Summary">

![](https://dl.dropbox.com/u/11851202/PUBLIC/SKYS/Posted/IT/About/NET/Libraries/QuickGraph/Concepts/00.png)


</panel>


### Contracts ###

* `IImplicitGraph` defines a graph that contains information about the out-edges of a vertex. 
    * This interface is particularly *important* when the size of your graph is infinite and you only have “local information”.
* `IIncidenceGraph` extends `IImplicitGraph` by providing the out-edges count,
* `IVertexListGraph` defines a graph that publishes the collection of vertices. 
    * With this concept, one can *iterate* the vertices and access the out edges of each vertex. 
    * This is an *important* concept that is used by many algorithms.
* `IEdgeListGraph` defines a graph that publishes the collection of edges. 
    * No information about out-edges is available.
* `IVertexAndEdgeListGraph` merges `IVertexListGraph` and `IEdgeListGraph` functionalities
* `IBidirectionalGraph` defines a vertex list graph that also publishes the in-edges.
    * Such graph can be used to explore a graph in a both directions.


## Reference ##

* [http://quickgraph.codeplex.com/wikipage?title=Traversal%20Concepts&referringTitle=Documentation](http://quickgraph.codeplex.com/wikipage?title=Traversal%20Concepts&referringTitle=Documentation)