|
Last change
on this file since 8461 was
8461,
checked in by spimming, 12 years ago
|
|
#1894:
- Implemented interface IGraph in Graph
- Equals method in vertex modified
- Equals method in Edge implemented
- New algorithm version for IGraph
|
|
File size:
776 bytes
|
| Line | |
|---|
| 1 |
|
|---|
| 2 | using System.Collections.Generic;
|
|---|
| 3 | namespace HeuristicLab.Problems.RoutePlanning.Graph {
|
|---|
| 4 | public interface IGraph {
|
|---|
| 5 | void AddVertex(Vertex vertex);
|
|---|
| 6 | Vertex GetVertex(long id);
|
|---|
| 7 | void AddEdge(long startId, long endId);
|
|---|
| 8 | void AddEdge(Edge<Vertex> edge);
|
|---|
| 9 | void RemoveEdge(long startId, long endId);
|
|---|
| 10 | bool HasEdge(long startId, long endId);
|
|---|
| 11 | Edge<Vertex> GetEdge(long startId, long endId);
|
|---|
| 12 | List<Edge<Vertex>> GetEdges(long vertexId);
|
|---|
| 13 | List<Edge<Vertex>> GetInEdges(long vertexId);
|
|---|
| 14 | List<Edge<Vertex>> GetOutEdges(long vertexId);
|
|---|
| 15 | Dictionary<long, float> GetNeighborsWithWeight(long id);
|
|---|
| 16 | Dictionary<long, float> GetNeighborsWithWeightReversed(long id);
|
|---|
| 17 | int GetOutDegree(long id);
|
|---|
| 18 | int GetInDegree(long id);
|
|---|
| 19 | }
|
|---|
| 20 | }
|
|---|
Note: See
TracBrowser
for help on using the repository browser.
