Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysis techniques have been presented for studying these models, using either linear programming and incidence matrix analysis, or graph theory approaches. In this paper two of such approaches, one based on linear algebra and one based on graph theory, are used to compute the steady-state firing speed and steady-state marking of continuous weighted marked graphs.