Graphs part 1.

Author: BSVino

game/main.cpp

@@ -15,6 +15,78 @@ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON A
 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
+#include <vector>
+#include <assert.h>
+
+using namespace std;
+
+class CGraph
+{
+public:
+	class CEdge
+	{
+	public:
+		int first;
+		int second;
+	};
+
+	class CNode
+	{
+	public:
+		vector<int> edges;
+	};
+
+	void AddNode()
+	{
+		nodes.push_back(CNode());
+	}
+
+	void AddEdge(int a, int b)
+	{
+		edges.push_back(CEdge());
+		edges.back().first = a;
+		edges.back().second = b;
+
+		nodes[a].edges.push_back(edges.size()-1);
+		nodes[b].edges.push_back(edges.size()-1);
+	}
+
+	CNode* GetNode(int i)
+	{
+		return &nodes[i];
+	}
+
+	CEdge* GetEdge(int i)
+	{
+		return &edges[i];
+	}
+
+protected:
+	vector<CNode> nodes;
+	vector<CEdge> edges;
+};
+
+int main()
+{
+	CGraph g;
+	g.AddNode();
+	g.AddNode();
+	g.AddNode();
+
+	g.AddEdge(0, 1);
+	g.AddEdge(1, 2);
+	g.AddEdge(0, 2);
+
+	printf("Node 0 has %d edges.\n", g.GetNode(0)->edges.size());
+
+	for (int i = 0; i < g.GetNode(0)->edges.size(); i++)
+	{
+		int edge = g.GetNode(0)->edges[i];
+		printf("Node 0 has an edge that goes between nodes %d and %d\n", g.GetEdge(edge)->first, g.GetEdge(edge)->second);
+	}
+}
+
+#if 0
 #include "game.h"
 
 int main(int argc, char* argv[])
@@ -33,3 +105,4 @@ int main(int argc, char* argv[])
 
 	return 0;
 }
+#endif